算法笔记-1-最大子列和-Maximum Subsequence Sum
题目内容:
Given a sequence of KK integers {N1,N2,...,NK N_1, N_2, ..., N_K}. A continuous subsequence is defined to be {Ni,Ni+1,...,Nj N_i, N_{i+1}, ..., N_j} where 1≤i≤j≤K1≤i≤j≤K1 \le i \le j \le K1≤i≤
原创
2016-09-18 22:58:39 ·
4859 阅读 ·
1 评论