SDUT 1351 Max Sum

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>

using namespace std;

int a[100100],b[100100];

int main()
{
    int T;
    int k = 0;
    scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        b[0] = a[0];
        for(int i=1;i<n;i++)
        {
            if(b[i-1]<0)
            {
                b[i] = a[i];
            }
            else
            {
                b[i] = a[i] + b[i-1];
            }
        }
        int xx,yy;
        int maxx = -999999;
        for(int i=0;i<n;i++)
        {
            if(maxx<b[i])
            {
                maxx = b[i];
                yy = i+1;
            }
        }
        int pmax = 0;
        for(int i=yy-1;i>=0;i--)
        {
            pmax += a[i];
            //printf("pmax = %d   maxx = %d\n",pmax,maxx);
            if(pmax == maxx)
            {
                xx = i+1;
               // break;
            }
        }
        printf("Case %d:\n",++k);
        printf("%d %d %d\n",maxx,xx,yy);
        if(T)
        {
            printf("\n");
        }
    }
    return 0;
}