摘要： 数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19305Accepted Submission(s): 11549Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个DP的题目，你能AC吗?Input输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是 阅读全文

摘要： WormTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2584Accepted Submission(s): 1667Problem Description自从见识了平安夜苹果的涨价后，Lele就在他家门口水平种了一排苹果树，共有N棵。突然Lele发现在左起第P棵树上(从1开始计数)有一条毛毛虫。为了看到毛毛虫变蝴蝶的过程，Lele在苹果树旁观察了很久。虽然没有看到蝴蝶，但Lele发现了一个规律：每过1分钟，毛毛虫会随机从一棵树爬到相邻的一棵 阅读全文

摘要： 放苹果Time Limit:1000MSMemory Limit:10000KTotal Submissions:24947Accepted:15887Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。Input第一行是测试数据的数目t（0 =j。i 2 #include 3 #include 4 using namespace std; 5 int dp[15][15]; 6 int main(){ 7 int ... 阅读全文

摘要： Gene AssemblyTime Limit:2 Seconds Memory Limit:65536 KBStatement of the ProblemWith the large amount of genomic DNA sequence data being made available, it is becoming more important to find genes (parts of the genomic DNA which are responsible for the synthesis of proteins) in these sequences. It is 阅读全文

摘要： Network SaboteurTime Limit:2000MSMemory Limit:65536KTotal Submissions:8751Accepted:4070DescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traf 阅读全文

摘要： RoadblocksTime Limit:2000MSMemory Limit:65536KTotal Submissions:6459Accepted:2406DescriptionBessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She has dec 阅读全文

摘要： EditorTime Limit: 3000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1236Accepted Submission(s): 391Problem DescriptionSample Input8I 2I -1I 1Q 3LDRQ 2Sample Output23HintThe following diagram shows the status of sequence after each instruction:一直wa，谁能告诉我哪错了！ 1 阅读全文

摘要： C. Ladder time limit per test 2 seconds memory limit per test 256 megabytes input standard input ... 阅读全文

摘要： To the MaxTime Limit:1000MSMemory Limit:10000KTotal Submissions:38914Accepted:20534DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all t 阅读全文

摘要： Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65535 K (Java/Others)Total Submission(s): 1977Accepted Submission(s): 822Problem DescriptionIn mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changin 阅读全文