Cod sursa(job #1319671)
Utilizator | Data | 17 ianuarie 2015 12:25:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int i, n, x;
int s, maxim;
int stm, drm, st;
int main()
{
fin >> n >> x;
maxim = x;
st = 1;
stm = 1;
drm = 1;
for (i=2; i<=n; ++i) {
fin >> x;
if (x >= s + x) {
st = i;
s = x;
} else {
s += x;
}
if (s >= maxim && drm - stm < i - st) {
maxim = s;
drm = i;
stm = st;
}
}
fout << maxim << " " << stm << " " << drm;
return 0;
}