【PAT】 PAT A-1007 Maximum Subsequence Sum

最新推荐文章于 2024-05-04 22:29:48 发布

昵称五个字

最新推荐文章于 2024-05-04 22:29:48 发布

阅读量1k

点赞数 1

分类专栏： PAT

本文链接：https://blog.csdn.net/a617976080/article/details/89093281

版权

该博客讨论了PAT(A-1007)问题，即给定一个整数序列，找出具有最大和的连续子序列及其起始和结束元素。当所有元素都是负数时，最大和定义为0，并输出整个序列的首尾元素。博主提供了解决问题的思路并附上了相关代码。

摘要由CSDN通过智能技术生成

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 separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.