01-复杂度2 Maximum Subsequence Sum

最新推荐文章于 2024-05-19 15:25:35 发布

原创

最新推荐文章于 2024-05-19 15:25:35 发布 · 652 阅读

1 ·

CC 4.0 BY-SA版权

探讨了最大子列和问题的升级版，通过实例解析如何寻找连续子序列中元素和最大的子列，并输出该子列的首尾元素值及总和。代码实现覆盖特殊情况处理，如所有数为负数或包含零。

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 Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

Input Specification:

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (≤10000). The second line contains K numbers, separated by a space.