Maximum Subsequence Sum

最新推荐文章于 2022-11-13 18:19:33 发布

sawdustcreep

最新推荐文章于 2022-11-13 18:19:33 发布

阅读量127

点赞数

分类专栏：浙大数据结构

本文链接：https://blog.csdn.net/cmxcjjp/article/details/106308361

版权

浙大数据结构专栏收录该内容

2 篇文章 0 订阅

订阅专栏

01-复杂度2 Maximum Subsequence Sum

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

代码

#include <iostream>
using namespace std;
int main(){
	int i,n;
	int x=0,y=0;//x，y要赋初值，不然会段错误，但是我也不知道为什么 
	int sum=0,maxsum=0,flag=0;
	int a[100010];
	cin>>n;
	for(i=0;i<n;i++){
		cin>>a[i];
	}
	for(i=0;i<n;i++){
		sum=sum+a[i];
		if(sum>maxsum){
			maxsum=sum;
			y=i;  //每次改变maxsum的时候记录连续子列和的最后一个元素
		}
		if (sum<0){
			sum=0; //如果和为负数那从下一个数开始重新加 
		}
		if (a[i]>=0){
			flag=1;
		}
	} 
	sum=0;
	for(i=y;i>=0;i--){
		sum=sum+a[i];
		if (sum==maxsum){
			x=i;
		//这里不要加break，但是我也不知道为什么 
		}
	} 
	if(maxsum>0&&flag==1) {
		cout << maxsum << " " << a[x] << " " << a[y] << endl;   //存在最大子列和的情况
    } 
    else if (flag==1)
		cout << 0 << " " << 0 << " " << 0 << endl;       //最大子列和为0的情况
	else if (flag==0)
		cout << 0 <<  " " << a[0] << " " << a[n-1] << endl;    //全为负数，输出第一个和最后一个

	return 0;
}