Cod sursa(job #2811767)
| Utilizator | Data | 3 decembrie 2021 08:48:30 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
FILE *fin, *fout;
int n, sum, sum_max, left, right, idx;
int main() {
fin = fopen("ssm.in", "r");
fout = fopen("ssm.out", "w");
fscanf(fin, "%d", &n);
for(int i = 1; i <= n; i++) {
int val;
fscanf(fin, "%d", &val);
if(sum < 0) {
sum = 0;
idx = i;
}
sum += val;
if(sum > sum_max) {
sum_max = sum;
left = idx;
right = i;
}
}
fprintf(fout, "%d %d %d\n", sum_max, left, right);
return 0;
}