Cod sursa(job #1341967)
| Utilizator | Data | 13 februarie 2015 12:35:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,max=-2147483648,prim=1,ultim=1,i,s=0,k;
FILE*fi,*fo;
fi=fopen("ssm.in","r");
fo=fopen("ssm.out","w");
fscanf(fi,"%d",&n);
for(i=0;i<n;i++)
{
fscanf(fi,"%d",&k);
if(s<0){
prim=i+1;
s=0;
}
s+=k;
if(s>max)
{
max=s;
ultim=i+1;
}
}
fprintf(fo,"%d %d %d",max,prim,ultim);
fclose(fi);
fclose(fo);
return 0;
}
