Pagini recente » Cod sursa (job #2089512) | Cod sursa (job #1204584) | Cod sursa (job #1383602) | Cod sursa (job #155852) | Cod sursa (job #2849783)
#include <iostream>
#include <fstream>
using namespace std;
int n, st, dr, v[6000001], s[6000001];
int main() {
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
s[i] = s[i - 1] + v[i];
v[0] = min(s[0], s[i]);
}
for (int i = n; i > 0; --i) {
if (v[0] < s[i] || v[0] == s[i] && v[i] >= v[dr]) {
v[0] = s[i];
dr = i;
}
}
st = dr;
while (st > 1 && s[st - 1] > 0) {
--st;
}
fout << s[dr] - s[st - 1] << ' ' << st << ' ' << dr;
return 0;
}