Max Sum

Problem Description:

Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.

Input:

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

Output:

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

code:

int main(int argc, char *argv[])
{
    int i,j;
    long result[100001],sum,max;
    int front,rear,rear2;
    long n;
    int time;
    while(scanf("%d",&time)==1)
    {
        for(j=1;j<=time;j++)
        {    
            scanf("%ld",&n);
            for(i=1;i<=n;i++)
                scanf("%ld",&result[i]);
            max=result[1];
            sum=0;
            front=1;
            rear=1;
            rear2=1;
            for(i=1;i<=n;i++)
            {
                sum+=result[i];
                if(sum>max)
                {
                    max=sum;
                    front=i;
                    rear=rear2;
                }
                if(sum<0)
                {
                    sum=0;
                    rear2=i+1;
                }
            }
            if(j==time)
                printf("Case %d:\n%d %d %d\n",j,max,rear,front);
            else
                printf("Case %d:\n%d %d %d\n\n",j,max,rear,front);
        }
    }
    
}