摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1231之前用并查集来做的；现在用dp来做：dp的状态方程：dp[i]=max(dp[i-1]+a[i],a[i]); 最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16818Accepted Submission(s): 7386 Problem Description给定K个整数的序列{ N1, N2, ..., NK }，其任意连续子序列 阅读全文
