GeekZRF

摘要：Coding Contest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1751 Accepted Submission(s): 374 P 阅读全文

摘要：The Windy's Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5477 Accepted: 2285 Description The Windy's is a world famous toy factory that 阅读全文

摘要：Dual Core CPU Time Limit: 15000MS Memory Limit: 131072K Total Submissions: 24830 Accepted: 10756 Case Time Limit: 5000MS Description As more and more 阅读全文

摘要：Evacuation Plan Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4914 Accepted: 1284 Special Judge Description The City has a number of muni 阅读全文

摘要：Farm Tour Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17307 Accepted: 6687 Description When FJ's friends visit him on the farm, he like 阅读全文

摘要：奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9828 Accepted Submission(s): 4328 Problem 阅读全文

摘要：Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18479 Accepted: 8243 Description Cows are such finicky eaters. Each cow has a prefer 阅读全文

摘要：Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22905 Accepted: 12421 Description Bessie wants to navigate her spaceship through 阅读全文

摘要：Kth number Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11394 Accepted Submission(s): 3465 Pr 阅读全文

摘要：K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 57543 Accepted: 19893 Case Time Limit: 2000MS Description You are working for 阅读全文

摘要：分桶法：把一排物品或者平面分成桶，每个桶分别维护自己内部的信息，已到达高效计算的目的的方法。 其中，平方分割是把排成一排的n个元素每√n个分在一个桶内进行维护的方法的统称。这样的方法可以使对区间的操作复杂度降至O（√n）。 以RMQ为例： 基于平方分割的RMQ 给定一个数列a1,a2,a3,a4,a 阅读全文

摘要：在RMQ的其他实现方法中，有一种叫做ST的算法比较常见。 【构建】 dp[i][j]表示的是从i起连续的2j个数xi,xi+1,xi+2,...xi+2j-1( 区间为[i,i+2j-1] )的最值。 状态转移方程dp[i][j]=max/min（dp[i][j-1], dp[i+2j-1][j-1 阅读全文

摘要：n的m划分 将n划分成若干个不超过m的数（正整数）的和，问有几种划分情况。 现在根据n和m的关系，考虑下面几种情况： 综上的递推表达式为： 将n划分成不超过m个数（正整数）的和，问有几种情况。 dp[i][j]表示j的i划分。 考虑n的m划分，如果对于每一个i都有xi>0，那么{xi-1}就对应了n 阅读全文

摘要：Jessica's Reading Problem Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12488 Accepted: 4255 Description Jessica's a very lovely girl woo 阅读全文

摘要：Subsequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14910 Accepted: 6301 Description A sequence of N positive integers (10 < N < 10 阅读全文

摘要：Zjnu Stadium Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3726 Accepted Submission(s): 1415 Pr 阅读全文

摘要：The King’s Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2947 Accepted Submission(s): 1 阅读全文