[PAT 甲级] 1007 Maximum Subsequence Sum （25 分)【动态规划】

1007 Maximum Subsequence Sum （25 分) 原题链接 Given a sequence of K integers { N ​​ }. A continuous subsequence is defined to be { N ​​ } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequenc

>>阅读原文<<