Cod sursa(job #1086512)
Utilizator | Data | 18 ianuarie 2014 11:41:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int i, j, k, s, smax, imax, jmax, n, a[6000001];
int main () {
fi >> n;
for (i = 1; i <= n; i++)
fi >> a[i];
smax = a[1];
for (i = 1; i <= n; i++)
for (j = i; j <= n; j++) {
s = 0;
for (k = i; k <= j; k++)
s += a[k];
if (s > smax) {
smax = s;
imax = i;
jmax = j;
}
}
fo << smax << ' ' << imax << ' ' << jmax;
return 0;
}