Cod sursa(job #2906266)
| Utilizator | Data | 25 mai 2022 13:06:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <stdio.h>
int main()
{
int n, i, iin, x, suma = 0, best = -(1e9), inc, sf;
FILE *in = fopen("ssm.in", "r");
fscanf(in, "%d", &n);
inc = 1; sf = n;
for(i = 0; i < n; ++i)
{
fscanf(in, "%d", &x);
if(suma < 0)
{
suma = x;
iin = i;
}
else suma += x;
if(suma > best)
{
best = suma;
inc = iin;
sf = i;
}
}
fclose(in);
FILE *out = fopen("ssm.out", "w");
fprintf(out, "%d %d %d", best, inc + 1, sf + 1);
fclose(out);
return 0;
}
