Cod sursa(job #2072468)
| Utilizator | Data | 21 noiembrie 2017 21:22:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
int n, i, x, max, s, inc, sf;
ifstream f("ssm.in");
ofstream g("ssm.out");
f >> n;
f >> max;
if (max > 0) s = max;
else s = 0;
inc = 1;
sf = 1;
for (i = 2; i <= n; i++) { f >> x;
s = s + x;
if (s > max) {max = s; sf = i;}
if (s < 0) {s = 0; inc = i + 1;}
}
if(max < 0) inc = sf;
g << max << ' ' << inc << ' ' << sf;
f.close();
g.close();
return 0;
}
