AC，∑ndless

http://codeforces.com/contest/387/problem/C/*31ms,100KB*/#includechar str[100005];int main(){ gets(str); int i, j, res = 0; for (i = 0; str[i]; i = j) { for (j = i + 1; str[j] == '0

1335 - Beijing GuardsTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=4081Beijing was once surrounded by

1267 - NetworkTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=3708Consider a tree network with n nodes w

12261 - High ScoreTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=onlinejudge&Itemid=99999999&category=244&page=show_problem&problem=3413思路：注意名字中有若干个A的情况，这时对每串连续的A进行“向左走，

贪心思路：从高位往低位考虑，若n的第i位是0，则m需尽量在这一位为1，且在这一位变为1后m<=U；若n的第i位是1，则m需尽量在这一位为0，但m不能太小以至于当L在这一位为1时m<L。完整代码：

10148 - AdvertisementTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1089The Department of Recreation ha

贪心思路：最终包的个数k取决于相同规格最多的包的数目（样例中2最多，那k就是2的个数——3）但是题目又要求每组包的数目最小，怎么输出呢？——排序后，间隔k输出即可，因为k是出现最多的数，所以每隔k个输出保证不会相同，同时每组包的数目又最小。完整代码：

10020 - Minimal coverageTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=961The ProblemGiven several

1398 - MeteorTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=460&page=show_problem&problem=4144The famous Korean internet company nhn h

10382 - Watering GrassTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=457&page=show_problem&problem=1323n sprinklers are installed in a

思路：1. 你肯定注意到了，面值最大的硬币c[n-1]必须要选。（反证：如果花了sum元却没有选中它，可知sum<c[n-1]，于是用m+c[n-1]元去兑换可以得到一个更优解。）2. 贪心的关键：假设S(i)是c[1]…c[i] 中那些被选中的货币的面值的和。那么一定有 S(i) < c[i+1]。3. 所以可以构造一个这样的序列出来。按照2中所说，如果有 S(i-1) < c[i]且S(i) =S(i-1)+c[i]<c[i+1]，那么c[i]将被选中。完整代码：

311 - PacketsTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=247A factory produces products packed in sq

http://codeforces.com/contest/370/problem/C/*31ms,0KB*/#include#includeusing namespace std;int C[5005];int main(){ int N, M; cin >> N >> M; for (int i = 0; i > C[i]; sort(C, C + N

C. Quizhttp://codeforces.com/contest/337/problem/Ctime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao

http://poj.org/problem?id=1032题意：把N个人分成若干组且每组人数不同，每天每组派一个人出来开会，并且每天开会的这群人不与前面的日子的开会人群不完全相同。也就是说，求N1+N2+...+Nn=N，使N1,N2,...,Nn都不相等且他们的乘积最大。思路：分的组越多乘积越大（在题意下ab>a+b）则有分法：设有一连续递增序列为2,3

http://code.google.com/codejam/contest/32016/dashboardProblemYou are given two vectors v1=(x1,x2,...,xn) and v2=(y1,y2,...,yn). The scalar product of these vectors is a single number, calcul

757 - Gone FishingTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=698John is going on a fishing trip. He has h hours a

1193 - Radar InstallationTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=3634http://poj.org/problem?id=1328Assume the coasting

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=4092思路：直接看这个和式，记A(i)=f(i)Σl(j) (1设sum已经达到最小，记sum1 = A(i)+A(i+1) = (f(i)+f(i+1))*(

C. Find Maximumhttp://codeforces.com/problemset/problem/353/Ctime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

1352 - Colored CubesTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=4098There are several colored cubes.

Journey with Pigshttp://poj.org/problem?id=3544Time Limit: 1000MSMemory Limit: 65536KDescriptionFarmer John has a pig farm near town A. He wants to visit his friend living

A. Secretshttp://codeforces.com/contest/333/problem/Atime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGe

B. Chipshttp://codeforces.com/problemset/problem/333/Btime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputG

B. Binary Numberhttp://codeforces.com/problemset/problem/92/Btime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

A1&A2. Special Taskhttp://codeforces.com/problemset/problem/316/A1http://codeforces.com/problemset/problem/316/A2time limit per test1 secondmemory limit per test256 megabytes

A. Old Peykanhttp://codeforces.com/contest/241/problem/Atime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

A. Boys and Girlshttp://codeforces.com/problemset/problem/253/Atime limit per test1 secondmemory limit per test256 megabytesinputinput.txtoutputoutput.txtTh

B. Taxihttp://codeforces.com/problemset/problem/158/Btime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA

A. Domino pilinghttp://codeforces.com/problemset/problem/50/Atime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

11729 - Commando WarTime limit: 1.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=2829“Waiting for orders we held in th

11292 - Dragon of LoowaterTime limit: 1.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=2267Once upon a time, in the

z

10026 - Shoemaker's ProblemTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=967Shoemaker has N jobs (order

10827 - Maximum sum on a torusTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1768A grid that wraps both h

108 - Maximum SumTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=44BackgroundA problem that is simple

507 - Jill Rides AgainTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=448Jill likes to ride her bicycle,

11389 - The Bus Driver ProblemTime limit: 1.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2384In a city there

A. Polo the Penguin and Stringshttp://codeforces.com/problemset/problem/288/Atime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutput

11520 - Fill the SquareTime limit: 1.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=2515In this problem, you have to d