Maximum Subsequence Sum

最新推荐文章于 2022-07-15 14:20:26 发布

allyyhh

最新推荐文章于 2022-07-15 14:20:26 发布

阅读量558

点赞数 3

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/allyyhh/article/details/88866595

版权

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≤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.

Output Specification:
For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be se

最低0.47元/天解锁文章