Cod sursa(job #828060)
Utilizator | Tudor Ciurca 2dor | Data | 2 decembrie 2012 22:19:46 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, i, j, s, smax, incep, sfar, sir[6000000];
int main() {
fin >> n;
for (; i < n; ++i)
fin >> sir[i];
fin.close();
for (i = 0; i < n; ++i) {
s = 0;
for (j = i; j < n; ++j) {
s += sir[j];
if (s > smax) {
smax = s;
incep = i;
sfar = j;
}
}
}
fout << smax << ' ' << incep + 1 << ' ' << sfar + 1;
fout.close();
return 0;
}