2015年05月_MiniSheep_CS

原创 POJ2262 Goldbach's Conjecture(素数问题)

Goldbach's ConjectureTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 40445 Accepted: 15481DescriptionIn 1742, Christian Goldbach, a German amateur mathe

2015-05-31 22:48:50 491

原创 POJ1046 Color Me Less(水题就当玩吧)

Color Me LessTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31681 Accepted: 15416DescriptionA color reduction is a mapping from a set of discrete color

2015-05-30 22:14:23 891

原创 POJ3278 Catch That Cow(广搜BFS)

Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 54969 Accepted: 17198DescriptionFarmer John has been informed of the location of a fugitiv

2015-05-30 20:27:41 391

原创 poj1014 Dividing(递归,多重背包)

DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 62888 Accepted: 16287DescriptionMarsha and Bill own a collection of marbles. They want to split

2015-05-30 15:43:23 921 5

原创 POJ3264(线段树求区间最大值和最小值)

Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 38054 Accepted: 17819Case Time Limit: 2000MSDescriptionFor the daily milking, Farme

2015-05-28 13:09:52 614

转载刘汝佳--线段树模版

一、线段树（点修改）Update(x,v): 把Ax修改为vQuery(L,R): 计算区间[qL,qR] 最小值。代码：// Dynamic RMQ// Rujia Liu// 输入格式：// n m 数组范围是a[1]~a[n]，初始化为0。操作有m个// 1 p v 表示设a[p]=v// 2 L R 查询a[L]~a[R]的min#inclu

2015-05-28 09:44:30 809

原创 POJ1061 青蛙的约会(数论扩展欧几里得算法)

青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 95323 Accepted: 17713Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面

2015-05-27 13:37:21 526

原创 POJ3468 A Simple Problem with Integers(线段树成段更新,区间查询)

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 72201 Accepted: 22282Case Time Limit: 2000MSDescriptionYou have N i

2015-05-26 16:16:03 478

原创 POJ1273 Drainage Ditches(最大流)

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 60927 Accepted: 23381DescriptionEvery time it rains on Farmer John's fields, a pond form

2015-05-24 18:37:10 352

原创 poj1159(滚动数组 + DP)

PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 55248 Accepted: 19105DescriptionA palindrome is a symmetrical string, that is, a string read

2015-05-20 12:45:24 437

原创算法导论-KMP模版

#include#include#includeusing namespace std;const int maxn = 10001;int next[maxn];void Compute(char *p) //匹配串和自己的next值{ int m = strlen(p); memset(next,0,sizeof(next)); next[1] =

2015-05-18 19:12:02 409

原创最大堆实现堆排序

#includeusing namespace std;const int maxn = 100001;int Parent(int i){ return i / 2;}int Left(int i){ return 2 * i; }int Right(int i){ return 2 * i + 1;}void Max_heapify(int *a,int

2015-05-07 16:13:11 334

原创矩阵的快速幂

#include#include#include#includeusing namespace std;struct matrix{ long long a[3][3];}origin,res;matrix multiply(matrix x,matrix y){ matrix temp; memset(temp.a,0,sizeof(temp.a))

2015-05-02 17:00:17 345

蒻菜_羊羊羊的专栏