Pagini recente » Cod sursa (job #1974362) | Cod sursa (job #2584903) | Cod sursa (job #1646977) | Cod sursa (job #455275) | Cod sursa (job #560221)
Cod sursa(job #560221)
#include<stdio.h>
FILE*fin,*fout;
long int v[16001],i,j,n,m,k,p,u,nr,c,min,max;
int main(){
fin=fopen("transport.in","r");
fout=fopen("transport.out","w");
fscanf(fin,"%ld %ld",&n,&k);
for(i=1;i<=n;i++){
fscanf(fin,"%ld",&v[i]);
if(v[i]>max){max=v[i];}
v[i]=v[i]+v[i-1];
}
p=max;
u=v[n];
while(p<=u){
m=(p+u)/2;
nr=0; c=0;
for(i=1;i<=n;){
while(v[i]-v[c]<=m&&i<=n){i++;}
nr++;
c=i-1;
}
if(nr>k) {p=m+1;}
else{
min=m;
u=m-1;
}
}
fprintf(fout,"%ld",min);
fclose(fin);
fclose(fout);
return 0;
}