01-复杂度2 Maximum Subsequence Sum (25 分)

最新推荐文章于 2024-09-12 19:02:20 发布

Wao立！立！

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量290

点赞数

分类专栏：浙江大学数据结构慕课文章标签：算法 c语言

本文链接：https://blog.csdn.net/weixin_49760236/article/details/121569538

版权

给定一个整数序列，定义连续子序列并找出具有最大元素和的子序列。当所有数字都为负数时，最大子序列和为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