PAT甲級--1007 Maximum Subsequence Sum (25)（25 分）【最大子序列和及其起始和終點】

1007 Maximum Subsequence Sum (25)（25 分）c++ Given a sequence of K integers { N~1~, N~2~, ..., N~K~ }. A continuous subsequence is defined to be { N~i~, N~i+1~, ..., N~j~ } where 1 <= i <= j <= K. The M

>>阅读原文<<