7-1 Maximum Subsequence Sum (25分)

最新推荐文章于 2021-08-11 20:47:17 发布

寻余

最新推荐文章于 2021-08-11 20:47:17 发布

阅读量350

点赞数

本文链接：https://blog.csdn.net/weixin_43725617/article/details/103851250

版权

给定一个整数序列，找到具有最大和的连续子序列，并输出最大和及子序列的第一个和最后一个数字。如果所有数字都为负，则最大和为0，输出整个序列的首尾数字。在线处理方法中，通过维护最大子序列和及起始和结束下标来解决问题。

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

文章目录

问题
解决方法(在线处理）
- 23分
- 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.
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

解决方法(在线处理）

23分

#include<iostream>
#include<vector>
using namespace std;
int main()
{
   
	int n, ThisSum = 0, MaxSum = 0;
	int Minnum=0, Maxnum=0;
	cin >> n;
	vector<int>list(n);
	for (int i