Cod sursa(job #2613391)
| Utilizator | Data | 9 mai 2020 17:04:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <stdio.h>
#include <stdlib.h>
FILE *fin , *fout;
int v[6000001];
int main() {
fin=fopen("ssm.in","r");
fout=fopen("ssm.out","w");
int n,i,x,start,smax,emax,max=-2147483648;
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++) {
fscanf(fin,"%d",&x);
if(v[i-1]<0) {
v[i]=x;
start=i;
}
else {
v[i]=v[i-1]+x;
}
if(v[i]>max) {
max=v[i];
smax=start;
emax=i;
}
}
fprintf(fout,"%d %d %d\n",max,smax,emax);
fclose(fin);
fclose(fout);
return 0;
}
