hdu 1003 Max Sum

A的好辛苦！！！

#include<iostream>
#define Max 100002
using namespace std;
int a[Max];

int main()
{ 
    int n, p = 1;
    bool pp = false;
    scanf("%d", &n);
    while(n--)
    {
        if(pp)
            printf("\n");
        pp = true;
        bool tt = false;
        int m, l = 0, r = 0, sum = 0, max = -1 * Max;
        int lmax = 0, rmax = 0, min = -1 * Max, lmin = 0, rmin = 0;
        scanf("%d", &m);
        int i, j;
        for( i=0; i < m; i++ )
        {
            scanf("%d", &a[i]);
            if(sum + a[i] >= 0 )
            {
                sum += a[i];
                r = i;
                if(max < sum)
                {
                    max = sum;
                    lmax = l;
                    rmax = r;
                }
            }
            else
            {
				sum = 0;
                l = i+1;
                r = i+1;
            }
            if(a[i] > 0)
                tt = true;
            else
            {
                if(min < a[i])
                {
                    min = a[i];
                    lmin = i;
                }

            }
        }
        if(tt)
            printf("Case %d:\n%d %d %d\n", p++, max, lmax+1, rmax+1);
        else
            printf("Case %d:\n%d %d %d\n", p++, min, lmin+1, lmin+1);
    }
    return 0;
}