Cod sursa(job #2909224)
Utilizator | Data | 10 iunie 2022 00:16:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
int main()
{
FILE *f, *g;
int n, i, sm = 0, s = 0, x, bi=1, b=1, e=1;
f = fopen("ssm.in.txt", "rt");
g = fopen("ssm.out.txt", "wt");
fscanf(f, "%d", &n);
for (i = 1; i <= n; i++)
{
fscanf(f, "%d", &x);
if (s + x >= 0)
{
s = s + x;
if (s > sm)
{
sm = s;
e = i;
b = bi;
}
}
else
{
s = 0;
bi = i+1;
}
}
fprintf(g, "%d %d %d", sm, b, e);
fclose(f);
fclose(g);
return 0;
}