#include <iostream> 
#include <fstream> 
#include <algorithm> 
using namespace std; 
const int MAXN = 7000005; 
#define FOR(i, a, b)  for (int i = (a); i <= (b); ++ i) 
#define Max(a, b)  ((a) > (b) ? (a) : (b)) 
int S[MAXN], n; 
int main(void) 
{     
ifstream in("ssm.in");     
in>>n;   
FOR (i, 1, n)  
in>>S[i];     
/* In rezolvarea de mai jos, S[i] retine suma tuturor valorile intre pozitiile 1 .. i     
 best[i] = Max(S[i] - S[j]) cu j < i =>     
 best[i] = S[i] - Min(S[j]) cu j < i   */
int bestSum = -int(2e9), min = 0, idx, beg, end;    
FOR (i, 1, n) {         
S[i] += S[i - 1];        
if (bestSum < S[i] - min)             
bestSum = S[i] - min, beg = idx + 1, end = i;         
if (min > S[i])             
min = S[i], idx = i; 
}    
ofstream out("ssm.out");    
out << bestSum << " " << beg << " " << end; 
in.close(), out.close();    
return 0; 
}