梦载代码

Apples and Ideas Time Limit: 2 Seconds      Memory Limit: 65536 KB A 简单题 "If you have an apple and I have an apple and we exchange these apples then you and I will still each have one appl

数列求和2 Time Limit: 1000MS Memory limit: 65536K 分析：该题明显是一个dp，求一个长为n的数列中m个不相冲突的区间和的最大值 dp[i][j] 表示 以第i个数字结尾且被分割为j的区间（不一定最优）；三重循环，最外层遍历i，中间遍历j，最内层是K的遍历前i-1的最优j的组合假设值为v， 则dp[i][j]=max(dp[i-1][j]