摘要：Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowingthat Ray has a photographic memory and this may no... 阅读全文

摘要：After doing Ray a great favor to collect sticks for Ray, Poor Neal becomes very hungry. In return for Neal's help, Ray makes a great dinner for Neal. ... 阅读全文

摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40159Accepted Submission(s): 16960Problem Desc... 阅读全文

摘要：Distance QueriesTime Limit:2000MSMemory Limit:30000KTotal Submissions:8638Accepted:3032Case Time Limit:1000MSDescriptionFarmer John's cows refused to ... 阅读全文

摘要：The merchantTime Limit:3000MSMemory Limit:65536KTotal Submissions:2887Accepted:958DescriptionThere areNcities in a country, and there is one and only ... 阅读全文

摘要：Housewife WindTime Limit:4000MSMemory Limit:65536KTotal Submissions:5471Accepted:1371DescriptionAfter their royal wedding, Jiajia and Wind hid away in... 阅读全文

摘要：Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5616Accepted Submissi... 阅读全文

摘要：Sliding WindowTime Limit:12000MSMemory Limit:65536KTotal Submissions:35941Accepted:10636Case Time Limit:5000MSDescriptionAn array of sizen≤ 106is give... 阅读全文

摘要：食物链Time Limit:1000MSMemory Limit:10000KTotal Submissions:40733Accepted:11850Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述：第一种说法是"1 X Y"，表示X和Y是同类。第二种说法是"2 X Y"，表示X吃Y。此人对N个动物，用上述两种说法，一句接一句地说出K句话，这K 阅读全文

摘要：Moo University - Financial AidTime Limit:1000MSMemory Limit:30000KTotal Submissions:4235Accepted:1293DescriptionBessie noted that although humans have many universities they can attend, cows have none. To remedy this problem, she and her fellow cows formed a new university called The University of W 阅读全文