01-复杂度2 Maximum Subsequence Sum(25 分)
Problem:
Given a sequence of KK integers {N1,N2,...,NK}.
A continuous subsequence is defined to be {Ni,Ni+1,...,Nj}
where 1≤i≤j≤K1≤i≤j≤K.
The Maximum Subsequence is the continuous subse
原创
2017-09-01 21:12:05 ·
515 阅读 ·
0 评论