PAT-甲级-1007 Maximum Subsequence Sum

最新推荐文章于 2024-12-16 14:46:31 发布

piudada

最新推荐文章于 2024-12-16 14:46:31 发布

阅读量896

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/sinat_34536092/article/details/81436972

版权

该博客介绍了PAT甲级编程题1007，题目要求找出给定序列中连续子序列的最大和及其起始和结束的数。博主首先分析了输入输出规格，接着分享了思路，包括处理全负数的情况和优化算法以避免超时。博主还提到了在解决问题过程中遇到的问题，如忽视了全负数的情况和不必要的计算函数。最后，博主给出了优化后的代码实现。

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

1007 Maximum Subsequence Sum (25)（25 分）

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.

Output Specification:

For each test case, output in one line the largest sum, together with the first and the last nu