#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
int maxSum = v[1];
int curSum = v[1];
int bestStart = 1;
int bestEnd = 1;
int tempStart = 1;
for (int i = 2; i <= n; i++) {
// daca e mai bine sa incepem un subsir nou de la i
if (curSum + v[i] < v[i]) {
curSum = v[i];
tempStart = i;
} else {
curSum += v[i];
}
// actualizam maximul global
if (curSum > maxSum) {
maxSum = curSum;
bestStart = tempStart;
bestEnd = i;
}
}
cout << maxSum << "\n";
cout << bestStart << " " << bestEnd << "\n";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShOVUxMKTsKCiAgICBpbnQgbjsKICAgIGNpbiA+PiBuOwoKICAgIHZlY3RvcjxpbnQ+IHYobiArIDEpOwogICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKQogICAgICAgIGNpbiA+PiB2W2ldOwoKICAgIGludCBtYXhTdW0gICAgPSB2WzFdOwogICAgaW50IGN1clN1bSAgICA9IHZbMV07CiAgICBpbnQgYmVzdFN0YXJ0ID0gMTsKICAgIGludCBiZXN0RW5kICAgPSAxOwogICAgaW50IHRlbXBTdGFydCA9IDE7CgogICAgZm9yIChpbnQgaSA9IDI7IGkgPD0gbjsgaSsrKSB7CiAgICAgICAgLy8gZGFjYSBlIG1haSBiaW5lIHNhIGluY2VwZW0gdW4gc3Vic2lyIG5vdSBkZSBsYSBpCiAgICAgICAgaWYgKGN1clN1bSArIHZbaV0gPCB2W2ldKSB7CiAgICAgICAgICAgIGN1clN1bSAgICA9IHZbaV07CiAgICAgICAgICAgIHRlbXBTdGFydCA9IGk7CiAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgY3VyU3VtICs9IHZbaV07CiAgICAgICAgfQoKICAgICAgICAvLyBhY3R1YWxpemFtIG1heGltdWwgZ2xvYmFsCiAgICAgICAgaWYgKGN1clN1bSA+IG1heFN1bSkgewogICAgICAgICAgICBtYXhTdW0gICAgPSBjdXJTdW07CiAgICAgICAgICAgIGJlc3RTdGFydCA9IHRlbXBTdGFydDsKICAgICAgICAgICAgYmVzdEVuZCAgID0gaTsKICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCBtYXhTdW0gPDwgIlxuIjsKICAgIGNvdXQgPDwgYmVzdFN0YXJ0IDw8ICIgIiA8PCBiZXN0RW5kIDw8ICJcbiI7CgogICAgcmV0dXJuIDA7Cn0=