hdu---1003---Max Sum

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include<vector>
#include<algorithm>
using namespace std;
#define PI 3.1415926

const int maxn=1000007;
const int INF=0x3f3f3f3f;

int a[maxn];
int main()
{
    int T, cas=1, f=0;
    scanf("%d", &T);
    while(T--)
    {
         if(f)
            puts("");///printf("\n");
        int n;
        scanf("%d", &n);
        for(int i=1; i<=n; i++)
            scanf("%d", &a[i]);

        int nows=1, Start=1, End=1;
        int sum, Max;
        sum=Max=a[1];

        for(int i=2; i<=n; i++)
        {
            if(sum+a[i]<a[i])
            {
                sum=a[i];
                nows=i;
            }
            else
                sum+=a[i];

            if(sum>Max)
            {
                Max=sum;
                Start=nows;
                End=i;
            }
        }
        printf("Case %d:\n%d %d %d\n", cas++, Max, Start, End);
        f=1;
    }
    return 0;
}