最大子序列

原题连接

#include<cstdio>
int a[100010];
int main()
{
	int t;
	scanf("%d",&t);
	for(int k = 1;k <= t;k++){
		int n ;
		scanf("%d",&n);
		for(int i = 1;i <= n;i ++){
			scanf("%d",&a[i]);
		} 
		int maxsum = -1001;
		int sum = 0;
		int s = 0,e = 0,m = 1;
		for(int i = 1;i <= n;i ++){
			sum += a[i];
			if(maxsum<sum){
				maxsum = sum;
				s = m;
				e = i;
			}
			if(sum < 0){
				sum = 0;
				m = i+1;
			}
		}
		if(k!=1)
			printf("\n");
		printf("Case %d:\n",k);
		printf("%d %d %d\n",maxsum,s,e);
	}
	return 0;
}