贱人方

摘要： D. Jury Meeting time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Country of Metropolia is 阅读全文

摘要： Roads 题目描述 In ICPCCamp, there are n towns conveniently labeled with 1,2,…,n and m bidirectional roads planned to be built. The i-th road will be built 阅读全文

摘要： Query on A Tree 题目描述 Monkey A lives on a tree. He always plays on this tree.One day, monkey A learned about one of the bit-operations, xor. He was kee 阅读全文

摘要： Lazy Running Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 101 Accepted Submission(s): 40 Pro 阅读全文

摘要： Ch’s gift Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 662 Accepted Submission(s): 229 Problem 阅读全文

摘要： 整数划分 将N分为若干个不同整数的和，有多少种不同的划分方式，例如：n = 6，{6} {1,5} {2,4} {1,2,3}，共4种。由于数据较大，输出Mod 10^9 + 7的结果即可。 将N分为若干个不同整数的和，有多少种不同的划分方式，例如：n = 6，{6} {1,5} {2,4} {1, 阅读全文

摘要： 最大M子段和 N个整数组成的序列a[1],a[2],a[3],…,a[n]，将这N个数划分为互不相交的M个子段，并且这M个子段的和是最大的。如果M >= N个数中正数的个数，那么输出所有正数的和。 例如：-2 11 -4 13 -5 6 -2，分为2段，11 -4 13一段，6一段，和为26。 N个 阅读全文

摘要： 度度熊的交易计划 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 254 Accepted Submission(s): 80 Problem 阅读全文

摘要： 小小粉丝度度熊 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 197 Accepted Submission(s): 78 Problem De 阅读全文

摘要： Two Paths time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output Two Paths time limit per test 2 阅读全文