随笔分类 -  DP

摘要：威威猫系列故事——打地鼠Time Limit: 300/100 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 59Accepted Submission(s): 45Problem Description 威威猫最近不务正业，每天沉迷于游戏“打地鼠”。 每当朋友们劝他别太着迷游戏，应该好好工作的时候，他总是说，我是威威猫，猫打老鼠就是我的工作！ 无话可说... 我们知道，打地鼠是一款经典小游戏，规则很简单：每隔一个时间段就会从地下冒出一只或多只地鼠，玩游戏的人要做的就是打地... 阅读全文

摘要：SubstringsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 183Accepted Submission(s): 42Problem DescriptionXXX has an array of length n. XXX wants to know that, for a given w, what is the sum of the distinct elements’ number in all substrings of le 阅读全文

摘要：lockerTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 248Accepted Submission(s): 87Problem DescriptionA password locker with N digits, each digit can be rotated to 0-9 circularly.You can rotate 1-3 consecutive digits up or down in one step.For exam 阅读全文

摘要：FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2859Accepted Submission(s): 1118Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is label 阅读全文

摘要：Math MagicTime Limit: 3 Seconds Memory Limit: 32768 KBYesterday, my teacher taught us about math: +, -, *, /, GCD, LCM... As you know, LCM (Least common multiple) of two positive numbers can be solved easily because of a * b = GCD (a, b) * LCM (a, b).In class, I raised a new idea: "how to calcu 阅读全文

摘要：Number StringTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 717Accepted Submission(s): 311Problem DescriptionThe signature of a permutation is a string that is computed as follows: for each pair of consecutive elements of the permutation, write d 阅读全文

摘要：Treats for the CowsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3689Accepted: 1844DescriptionFJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a gi 阅读全文

摘要：RelocationTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1106Accepted: 447DescriptionEmma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping them relocate. To move the furniture, they only have two compact c 阅读全文

摘要：You Are the OneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 402Accepted Submission(s): 221Problem Description The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show. 阅读全文

摘要：Divide ChocolateTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1061Accepted Submission(s): 505Problem DescriptionIt is well known that claire likes dessert very much, especially chocolate. But as a girl she also focuses on the intake of calories e 阅读全文

摘要：The time of a dayTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 742Accepted Submission(s): 327Problem DescriptionThere are no days and nights on byte island, so the residents here can hardly determine the length of a single day. Fortunately, they 阅读全文

摘要：Resource ArchiverTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 899Accepted Submission(s): 238Problem DescriptionGreat! Your new software is almost finished! The only thing left to do is archiving all your n resource files into a big one.Wait 阅读全文

摘要：Wireless PasswordTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2189Accepted Submission(s): 610Problem DescriptionLiyuan lives in a old apartment. One day, he suddenly found that there was a wireless network in the building. Liyuan did not know th 阅读全文

摘要：Ignatius and the Princess IIITime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description"Well, it seems the first problem is too easy. I will let you know 阅读全文

摘要：Brackets SequenceTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 18313Accepted: 5020Special JudgeDescriptionLet us define a regular brackets sequence in the following way: 1. Empty sequence is a regular sequence. 2. If S is a regular sequence, then (S) and [S] are both regular sequences. 3. 阅读全文

摘要：青蛙过河Time Limit: 1000 MSMemory Limit: 65535 KTotal Submit: 29(11 users)Total Accepted: 9(9 users)Special Judge: NoDescription在河上有一座独木桥，一只青蛙想沿着独木桥从河的一侧跳到另一侧。在桥上有一些石子，青蛙很讨厌踩在这些石子上。由于桥的长度和青蛙一次跳过的距离都是正整数，我们可以把独木桥上青蛙可能到达的点看成数轴上的一串整点：0，1，……，L（其中L是桥的长度）。坐标为0的点表示桥的起点，坐标为L的点表示桥的终点。青蛙从桥的起点开始，不停的向终点方向跳跃。一次跳跃的距离 阅读全文

摘要：To The MaxTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3768Accepted Submission(s): 1798Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater locat 阅读全文