Pagini recente » Cod sursa (job #2534846) | Cod sursa (job #2451854) | Cod sursa (job #1647500) | Cod sursa (job #1601176) | Cod sursa (job #3121520)
#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
const int kNMax = 6000000;
int v[kNMax + 1];
int sp[kNMax + 1];
int main() {
int n; in >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
for (int i = 1; i <= n; i++) {
sp[i] = sp[i - 1] + v[i];
}
int max = v[1], l_max = 1, r_max = 1;
int min = 0, indice_min = 0;
for (int j = 1; j <= n; j++) {
int sum_curr = sp[j] - min;
if (sum_curr > sum_max) {
sum_max = sum_curr;
l_max = indice_min + 1;
r_max = j;
}
if (min > sp[j]) {
min = sp[j];
indice_min = j;
}
}
cout << sum_max << " " << l_max << " " << r_max << "\n";
return 0;
}