Cod sursa(job #629845)
Utilizator | Sebastian Claici sebii_c | Data | 4 noiembrie 2011 01:46:14 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ssm.in");
int n, best = 0, i, beg, end, maxim = -(2e9), idx, x;
fin >> n;
for (i=1; i<=n; ++i) {
fin >> x;
if (best < 0)
best = x, idx = i;
else
best += x;
if (best > maxim) {
maxim = best;
beg = idx;
end = i;
}
}
ofstream fout("ssm.out");
fout << maxim << " " << beg << " " << end;
return 0;
}