Meek

摘要： 题目意思：给定Q（1#include #include #include #include #include #include #include #include using namespace std;typedef __int64 ll;const int inf = (int)1E9+10;i... 阅读全文

摘要： POJ2342：题意：某公司要举办一次晚会，但是为了使得晚会的气氛更加活跃，每个参加晚会的人都不希望在晚会中见到他的直接上司，现在已知每个人的活跃指数和上司关系（当然不可能存在环），求邀请哪些人（多少人）来能使得晚会的总活跃指数最大。题解：当i来的时候，dp[i][1] += dp[j][0];//... 阅读全文

摘要： SwapTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2174Accepted Submission(s): 774Special JudgePr... 阅读全文

摘要： Network of SchoolsTime Limit:1000MSMemory Limit:10000KTotal Submissions:5354Accepted:2106DescriptionA number of schools are co... 阅读全文

摘要： C. George and JobThe new ITone 6 has been released recently and George got really keen to buy it. Unfortunately, he didn't have... 阅读全文

摘要： 题意：给出一棵树，每个节点都被标记了黑或白色，要求把这棵树的其中k条变切换，划分成k+1棵子树，每颗子树必须有1个黑色节点，求有多少种划分方法。题解：树形dpdp[x][0]表示是以x为根的树形成一块不含黑色点的方案数dp[x][1]表示是以x为根的树形成一块含一个黑色点方案数//зїеп:1085... 阅读全文

摘要： PermutationProblem DescriptionThere is an arrangement of N numbers and a permutation relation that alter one arrangement into a... 阅读全文

摘要： Xiao Ming's HopeTime Limit:1000MSMemory Limit:32768KBDescriptionXiao Ming likes counting numbers very much, especially he is fond of counting odd numb... 阅读全文

摘要： C -History repeat itselfTime Limit:1000MSMemory Limit:32768KBDescriptionTom took the Discrete Mathematics course in the 2011,but his bad attendance an... 阅读全文

摘要： B -Gold minerTime Limit:2000MSMemory Limit:32768KB DescriptionHomelesser likes playing Gold miners in class. He has to pay much attention to the teac... 阅读全文