/*
    Maximum Subsequence Sum Problem 90 pct
*/

#include <stdio.h>
#include <stdlib.h>
#include <limits.h>

int main()
{
	int i, maxSum=-INT_MAX;
    int start_idx=0, end_idx=0, temp=0, sum=0, num, n;
    FILE* g;
    g = fopen("ssm.out", "wt");
    FILE* f;
    f = fopen("ssm.in", "rt");

    fscanf(f,"%d",&n);

    for(i=0;i<n;i++)
    {
        fscanf(f,"%d",&num);
        if(sum<0)
        {
            sum=num;
            temp=i;
        }
        else{
            sum+=num;
        }
        if(sum>maxSum)
        {
            maxSum = sum;
            start_idx=temp;
            end_idx=i;
        }
    }

    fprintf(g,"%d %d %d", maxSum,start_idx+1,end_idx+1);

    fclose(f);
    fclose(g);
	return 0;
}