Cod sursa(job #2909494)
| Utilizator | Data | 13 iunie 2022 23:03:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
int main()
{
FILE *fin=fopen("ssm.in", "r");
FILE *fout=fopen("ssm.out", "w");
int n, S;
int bestSum = -int(2e9), sum = 0, beg, end, idx;
fscanf(fin, "%d", &n);
for(int i=0; i<n; ++i)
{
fscanf(fin, "%d", &S);
if (sum < 0)
sum = S, idx = i;
else
sum += S;
if (bestSum < sum)
bestSum = sum, beg = idx, end = i;
}
fprintf(fout, "%d %d %d", bestSum, beg+1, end+1);
fclose(fin);
fclose(fout);
return 0;
}
