HDU1003前导和

简单维护前导和

#include<stdio.h>
int main()
{
    int sum,a[100005],cas,key=1;
    scanf("%d",&cas);
    while(cas--){
        int n,i,max_sum,max_index,min_index,keyl;
        scanf("%d%d",&n,&a[0]);
        max_sum=sum=a[0];
        keyl=0;
        max_index=min_index=1;
        if(sum<0){sum=0;keyl=1;}
        for(i=1;i<n;i++){
            scanf("%d",&a[i]);
            sum+=a[i];
            if(sum>max_sum){
                max_sum=sum;
                max_index=i+1;
                min_index=keyl+1;
            }
            if(sum<0){
                sum=0;
                keyl=i+1;
            }
        }
        printf("Case %d:
",key++);
        printf("%d %d %d
",max_sum,min_index,max_index);
        if(cas)printf("
");
    }
    return 0;
}