HDU 1003：Max Sum【水】

Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 193836    Accepted Submission(s): 45186

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
  
  

 细心细心再细心。。。。

AC-code:

#include<cstdio>
int main()
{
	int T,i,n,j,ans,ed,p,st,sum,a[100005];
	scanf("%d",&T);
	for(i=1;i<=T;i++)
	{
		if(i!=1)
			printf("\n");
		scanf("%d",&n);
		for(j=1;j<=n;j++)
			scanf("%d",&a[j]);
		ans=0;
		st=ed=p=1;
		ans=sum=a[1];
		for(j=2;j<=n;j++)
		{
			if(sum+a[j]<a[j])
			{
				sum=a[j];
				p=j;
			}
			else
			{
				sum+=a[j];
			}
			if(sum>ans)
			{
				ans=sum;
				st=p;
				ed=j;
			}
		}
		printf("Case %d:\n",i);
		printf("%d %d %d\n",ans,st,ed);
	}
	return 0;
 }