1007 Maximum Subsequence Sum (25分) C语言 最简单方法
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 conti...
原创
2020-04-18 23:37:21 ·
190 阅读 ·
0 评论