【PAT甲级 - C++题解】1007 Maximum Subsequence Sum

最新推荐文章于 2025-12-23 09:31:03 发布

原创

最新推荐文章于 2025-12-23 09:31:03 发布 · 611 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法 #数据结构 #PAT #动态规划

本文解析了最大子序列和问题的算法实现，通过动态规划方法高效求解序列中具有最大和的连续子序列，并给出具体代码实现。

✍个人博客：https://blog.youkuaiyun.com/Newin2020?spm=1011.2415.3001.5343
📚专栏地址：PAT题解集合
📝原题地址：题目详情 - 1007 Maximum Subsequence Sum (pintia.cn)
🔑中文翻译：最大子序列和
📣专栏定位：为想考甲级PAT的小伙伴整理常考算法题解，祝大家都能取得满分！
❤️如果有收获的话，欢迎点赞👍收藏📁，您的支持就是我创作的最大动力💪

1007 Maximum Subsequence Sum

Given a sequence of K integers { N₁, N₂, …, 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.

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.

Sample Input:
10
-10 1 2 3 4 -5 -23 3 7 -21
Sample Output:
10 1 4