2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5
Case 1: 14 1 4 Case 2: 7 1 6
#include <cstdio>
int main()
{
freopen("input.txt","r",stdin);
int n,T,num,sum,max,t,l,r;
scanf("%d",&T);
int cas=1;
while(T--)
{
sum=0;
max=-1<<30;t=l=r=1;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&num);
if(sum<0){sum=num;t=i;}
else sum+=num;
if(sum>max){max=sum,l=t,r=i;}
}
printf("Case %d:\n%d %d %d\n",cas++,max,l,r);
if(T)printf("\n");
}
return 0;
}hdu 1003(最大连续子序列和),布布扣,bubuko.com
原文:http://blog.csdn.net/acvcla/article/details/23005293