HDU1003--最大连续子序列

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
  
  

怎么回事？？老是不能1A。。。

注意这个是负数的时候会输出负数的。

而且1到3 和1 到7相同，输出1到3.

#include <iostream>
#include <cstdio>
using namespace std;
#define maxn 100008
#define inf 0x3f3f3f3f
int A[maxn];
int S[maxn];
inline int max(int a,int b){return a>b?a:b;}
int main()
{
	int n,t;
	scanf("%d",&t);
	for(int z=1;z<=t;z++)
	{
		scanf("%d",&n);
		int sum=0,maxsum=0,tou=1,wei=n,maxx=-inf;
		int val=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&A[i]);
			sum+=A[i];
			if(A[i]>maxx){maxx=A[i];val=i;}
			S[i]=i==1?A[i]:S[i-1]+A[i];
			if(sum>maxsum)
			{
				maxsum=sum;
				wei=i;
			}
			if(sum<0)sum=0;
		}
		for(int i=0;i<=wei;i++)
		{
			if(S[wei]-S[i]==maxsum)
			{
				tou=i+1;
				break;
			}
		}
		printf("Case %d:\n",z);
		if(maxsum)
		{
			printf("%d %d %d\n",maxsum,tou,wei);
		}
		else 
		{
			printf("%d %d %d\n",maxx,val,val);
		}
		if(z!=t)printf("\n");
	}
	return 0;
}