杭电1003《Max Sum》

Max Sum

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

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
  
  

 

#include <stdio.h>
int main()
{
	int times,now,n,start,end,max,x;
	int a[100010];
	scanf("%d",times);//定义次数
	for (int i=1;i<=times;i++)
	{
		scanf("%d",&n);
		for (int j=1;j<=n;j++)
		{
            scanf("%d",&a[j]);
		}
		x=start=end=1;//将开始和结束的位置都记录为第一个
		max=now=a[1];//将现在的值和最大值都记录为第一个
		for (int k=2;k<=n;k++)
		{
			if (now+a[k]<a[k])
			{
				now=a[k];
				x=k;
			}//对于设置一个中间变量有点疑惑，如果当now+a[k]<a[k]时直接将k的值赋给start后果是什么？
			else//例如 1 -2 1;max=1,start和end都是1.当1+-2+1<1时，我们应该把start赋给3吗？
			{
				now+=a[k];
			}
			if (now>max)
			{
				max=now;
				end=k;
				start=x;//所以要从这里判断下去，如果now，现在的now是1，但是他不大于max所以我们的开始位置应该是1而不是3
			}
		}
		printf("Case %d:\n",i);
		printf("%d %d %d\n",max,start,end);
		if (i!=times)
		{
			printf("\n");
		}
	}
}