Cod sursa(job #2238066)
Utilizator | Data | 4 septembrie 2018 14:34:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <cstdio>
using namespace std;
int n, sum, smax = -6000005, ii, st, dr, v[6000005];
int main()
{
FILE *in, *out;
in = freopen("ssm.in", "r", stdin);
out = freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &v[i]);
fclose(in);
for (int i = 1; i <= n; ++i) {
if (sum < 0) {
sum = v[i];
ii = i;
}
else sum += v[i];
if (sum > smax) {
smax = sum;
st = ii;
dr = i;
}
}
printf("%d %d %d", smax, st, dr);
fclose(out);
return 0;
}