子序列最大和（杭电acm1003）

最新推荐文章于 2024-09-10 21:48:29 发布

zhu_wei_jian

最新推荐文章于 2024-09-10 21:48:29 发布

阅读量4.4k

点赞数 2

分类专栏： ACM 文章标签： output integer input each c

本文链接：https://blog.csdn.net/zhu_wei_jian/article/details/7393035

版权

ACM 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Max Sum

Problem Description

Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.

Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

Sample Input

  
  
   
   2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Sample Output

  
  
   
   Case 1:
14 1 4

Case 2:
7 1 6
  
  
  
  

  
  
  
  

  
  
  
  

  
  
  
  

  
  
  
  
   
   代码（C++）
   
   #include<iostream>
using namespace std;
#include<string.h>
using namespace std;
int main()
{
	int t,i,j,sum,a,n,l,r,max,z;
	cin>>t;
	for(i=0;i<t;i++)
	{
		cin>>n;
		for(z=l=0,r=0,sum=0,max=-1001,j=0;j<n;j++)
		{
			cin>>a;
			sum+=a;
			if(max<sum)
			{
				l=z;
				r=j;
				max=sum;
			}
			if(sum<0)
			{
				z=j+1;
				sum=0;
			}
		}
		cout<<"Case "<<i+1<<":\n"<<max<<" "<<l+1<<" "<<r+1<<endl;
		if(i<t-1)
			cout<<endl;
	}
}