2021-05-05

题
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"
#include"string.h"
const int mx=-0x3f3f3f33;
int a[101001],b[101001];
int main()
{
	int i,j,k=0,t,n,m,x,tt;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&x);
		m=mx;
		tt=1;
		int s=0;
		int e=1,r=1;
		for(i=1; i<=x; i++)
		{
			scanf("%d",&a[i]);
			s=s+a[i];
			if(s>m)
			{
				m=s;
				e=tt;
				r=i;
			}
			if(s<0)
			{
				s=0;
				tt=i+1;
			}
			/*
			if(s<0)
			{
				s=0;
				tt=i+1;
			}
			if(s>m)
			{
				m=s;
				e=tt;
				r=i;
			}为什么错？ 最大值可能为负
			如；6 -1 -2 -3 -4 -5 -6 
			 */
		}
		printf("Case %d:\n%d %d %d\n",++k,m,e,r);
		if(t)printf("\n"); 
		memset(b,0,sizeof(b));
	}
	return 0;
}