Pagini recente » Cod sursa (job #1631820) | Cod sursa (job #2888395) | Cod sursa (job #2560811) | Borderou de evaluare (job #1569232) | Cod sursa (job #164452)
Cod sursa(job #164452)
# include <stdio.h>
FILE *f;
long N,k,i,sum[50000],min,max,p1,p2;
long A[50000];
int main()
{
f=fopen("secv2.in","r");
fscanf(f,"%ld %ld",&N,&k);
for(i=1;i<=N;i++)
fscanf(f,"%ld",&A[i]);
fclose(f);
sum[0] = 0;max=-2147483648;
for (i = 1; i <= N; i++){
sum[i] = A[i] + sum[i-1];
if (sum[i]>max) {
max=sum[i]; p1=i;
}
}
for (i=1;i<=p1+1;i++)
sum[i]=0;
max=-2147483648;
for (i = p1; i >0; i--){
sum[i] = A[i] + sum[i+1];
if (sum[i]>=max) {
max=sum[i]; p2=i;
}
}
f=fopen("secv2.out","w");
fprintf(f,"%ld %ld %ld",p2,p1,max);
fclose(f);
return 0;
}