Cod sursa(job #534610)
| Utilizator | Data | 15 februarie 2011 21:30:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main() {
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, i, x, s = 0, best = -int(2e9), id_start, id_end, ids;
fin >> n;
for(i = 1; i <= n; i++) {
fin >> x;
if(s < 0) {
s = x;
ids = i;
}else
s += x;
if(s > best) {
best = s;
id_start = ids;
id_end = i;
}
}
fout << best << " " << id_start << " " << id_end;
fin.close(); fout.close();
return 1;
}