pat 甲级 动态规划 A1007 Maximum Subsequence Sum (25分)最大连续子序列和
1007 Maximum Subsequence Sum (25分)
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the lar
原创
2020-08-24 09:11:35 ·
125 阅读 ·
0 评论