01-复杂度2 Maximum Subsequence Sum
原题描述:
Given a sequence of K integers
{ N1, N2,
..., NK }.
A continuous subsequence is defined to be { Ni, Ni+1,
..., Nj }
where 1. The Maximum Subsequence is the continu
原创
2017-11-17 21:54:24 ·
286 阅读 ·
1 评论