#include<fstream>
using namespace std;

ifstream f("ssm.in");
ofstream g("ssm.out");

int main ()
{
	long long n,i,a[100001],nr,v[100001],best=-999999999,j,poz1,poz2,min,p_min;
	f>>n;
	a[0]=0;
	for (i=1; i<=n; i++)
	{
		f>>v[i];
		a[i]=a[i-1]+v[i];
	}
	min=9999999;
	for (i=1; i<n; i++)
	{
		if (a[i]<min) { min=a[i]; p_min=i; }
		if (a[i]-min>best) { best=a[i]-min; poz1=p_min+1; poz2=i; }
	}
	g<<best<<" "<<poz1<<" "<<poz2;
	return 0;
}