摘要：
时间限制：1000ms | 内存限制：65535KB难度：3描述Given a positive integer N (0 2 #include 3 #include 4 using namespace std; 5 #define INF 100003 6 int dp[10002]; 7 int main() 8 { 9 int i, z, n;10 dp[1] = 1, dp[2] = 2;11 for(i = 3; i < 10001; i++){12 dp[i] = INF;13 for(z = 1; z < i && z <=... 阅读全文
摘要：
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6725Accepted Submission(s): 2251Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult 阅读全文