御心飞行

摘要： Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14555    Accepted Submission(s): 5119         阅读全文

摘要： The Suspects Time Limit: 1000MS Memory Limit: 20000K Total Submissions: 30158 Accepted: 14665 Description Severe acute respiratory syndrome (SARS), an 阅读全文

摘要： 免费馅饼 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36627 Accepted Submission(s): 12508 Problem 阅读全文

摘要： 搬寝室 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23264 Accepted Submission(s): 7951 Problem De 阅读全文

摘要： FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13133 Accepted Submission(s): 57 阅读全文

摘要： Bone Collector II Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3471 Accepted Submission(s): 17 阅读全文

摘要： Palindrome Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 58168 Accepted: 20180 Description A palindrome is a symmetrical string, that is, 阅读全文

摘要： Proud Merchants Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 4257 Accepted Submission(s): 175 阅读全文

摘要： 给定一棵无根树，选出尽可能多的点，使得任何两个节点均不相邻 1 #include <iostream> 2 #include <vector> 3 #include <algorithm> 4 using namespace std; 5 6 /*************************** 阅读全文

摘要： Description Building and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such th 阅读全文

摘要： 题意： 给定n个定点和m个士兵，n个定点最终构成一棵树，每个定点有一定x个bugs和y个value,每20个bug需要消耗一个士兵，不足20也消耗一个，然后最终收获y个value，只有父节点被占领后子节点才有被占领的可能。 DP状态转移方程： dp[p][j]=max(dp[p][j],dp[p][ 阅读全文

摘要： Strategic game Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 7490 Accepted: 3483 Description Bob enjoys playing computer games, especiall 阅读全文

摘要： Anniversary party Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5767 Accepted: 3335 Description There is going to be a party to celebrate 阅读全文

摘要： Advanced Fruits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2358 Accepted Submission(s): 1201 阅读全文

摘要： Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30163 Accepted S 阅读全文

摘要： Dividing Sample Input 1 0 1 2 0 0 价值为1，2，3，4，5，6的物品数目分别为 1 0 1 2 0 0，求能否将这些物品按价值分为两堆，转化为多重背包。1 0 0 0 1 10 0 0 0 0 0 Sample Output Collection #1: Can't 阅读全文

摘要： Raising Modulo Numbers Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5934 Accepted: 3461 Description People are different. Some secretly 阅读全文

摘要： 2016-2-15：新年的第一篇心情，慢慢更新。 1.以后的文章当然都会是ACM竞赛的题解，但会多写写自己的思考以及总结，因为感觉自己缺少思考这个习惯，有些东西在脑子里也只是一带而过，最后也不会停留多久，这个真心有点跪，多抽点时间做题吧多思考多交流吧，已经懒癌最晚期了，想想王大神在我这个时间的时候还 阅读全文

摘要： 1 #include <cstring> 2 #include <cstdio> 3 #include <iostream> 4 #include <cmath> 5 #include <algorithm> 6 using namespace std; 7 #define LL long long 阅读全文

摘要： X-factor Chains Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6212 Accepted: 1928 Description Given a positive integer X, an X-factor cha 阅读全文