6
-2 11 -4 13 -5 -2
10
-10 1 2 3 4 -5 -23 3 7 -21
6
5 -8 3 2 5 0
1
10
3
-1 -5 -2
3
-1 0 -2
0

20 11 13
10 1 4
10 3 5
10 10 10
0 -1 -2
0 0 0

Hint
Hint
 
Huge input, scanf is recommended.

#include<bits/stdc++.h>

using namespace std;

int anss,sum,l,r,anssl,anssr,i,n,a[10005];

int main()
{
    while(scanf("%d",&n),n!=0)
    {
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        sum=a[1];
        l=1;
        r=1;
        anssl=1;
        anssr=1;
        anss=a[1];
        for(i=2;i<=n;i++)
        {
            if(sum<0)
            {
                sum=a[i];
                l=i;
                r=i;
            }
            else
            {
                sum+=a[i];
                r++;
            }
            if(sum>anss)
            {
                anss=sum;
                anssl=l;
                anssr=r;
            }
        }
        if(anss<0)
        {
            printf("0 %d %d\n",a[1],a[n]);
        }
        else
        {
            printf("%d %d %d\n",anss,a[anssl],a[anssr]);
        }
    }
}