PAT甲级真题(动态规划)——1007 Maximum Subsequence Sum （25 分）

最新推荐文章于 2021-12-08 16:16:00 发布

原创

最新推荐文章于 2021-12-08 16:16:00 发布 · 448 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#算法学习 #PAT

该博客介绍了PAT甲级考试中的一道动态规划问题——找到序列中最大子序列的和及其起始和结束数字。当所有数字都为负数时，最大和定义为0，并返回序列的第一个和最后一个数字。博客提供了问题解析和解题代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1007 Maximum Subsequence Sum （25 分）

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.