Pagini recente » Cod sursa (job #153038) | Cod sursa (job #3180005) | Cod sursa (job #1173935) | Cod sursa (job #197998) | Cod sursa (job #2848369)
#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];
}
for (int i = n; i > 0; --i) {
if (s[0] <= s[i]) {
s[0] = s[i];
dr = i;
}
}
for (int i = dr; i > 0; --i) {
if (s[0] > s[i]) {
s[0] = s[i];
st = i;
}
}
fout << s[dr] - s[st++] << ' ' << st << ' ' << dr;
return 0;
}