Maximum Subsequence Sum 浙大pta 时间复杂度已降到O（n）

最新推荐文章于 2022-10-25 17:17:36 发布

落叶无痕sd

最新推荐文章于 2022-10-25 17:17:36 发布

阅读量259

点赞数

文章标签： Maximum Subsequence Sum 数据结构与算法

本文链接：https://blog.csdn.net/weixin_40258914/article/details/84939229

版权

该博客介绍了如何在O(n)的时间复杂度内找到一个整数序列的最大子序列和。文章通过举例说明了最大子序列的概念，并提供了浙大pta平台上的相关问题。内容包括输入输出规格及示例，要求找到序列的最大和以及最大子序列的起始和结束数值。若所有数字都为负，则最大和为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.