Pagini recente » Cod sursa (job #2517538) | Cod sursa (job #1352767) | Cod sursa (job #1722499) | Cod sursa (job #1483106) | Cod sursa (job #2795627)
#include <iostream>
#include <fstream>
using namespace std;
const int SIZE_N = 6000001;
int sp[SIZE_N] = {0};
int main() {
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int x, n;
cin >> n >> x;
sp[1] = x;
for (int i = 2; i <= n; ++i) {
cin >> x;
sp[i] = sp[i - 1] + x;
}
int maxim = sp[2] - sp[1], start = 1, end = 2;
for (int i = 1; i <= n; ++i) {
for (int j = n; j > i; --j) {
if (sp[j] - sp[i - 1] > maxim) {
maxim = sp[j] -sp[i - 1];
start = i;
end = j;
}
}
}
cout << maxim << ' ' << start << ' ' << end;
}