Pagini recente » Cod sursa (job #1932661) | Cod sursa (job #2170646) | Cod sursa (job #2783066) | Cod sursa (job #1184155) | Cod sursa (job #814799)
Cod sursa(job #814799)
#include<stdio.h>
int v[16001];
int main(){
int k,i,n,s,sum,pp,cap,l1,l2,max,ma,nr;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
sum=0;
max=0;
for(i=1;i<=n;i++){
scanf("%d",&v[i]);
if(v[i]>max)
max=v[i];
sum+=v[i];
}
ma=sum/k;
if(ma>=max){
l1=ma;
l2=sum;
}
else{
l1=max;
l2=sum;
}
pp=0;
while(l1<=l2&&pp==0){
cap=(l1+l2)/2;
nr=1;
s=0;
for(i=1;i<=n;i++)
if(s+v[i]<=cap)
s+=v[i];
else{
nr++;
s=v[i];
}
//if(nr==k)
// pp=cap;
//else
if(nr<=k)
l2=cap-1;
else
l1=cap+1;
}
pp=1;
int ccap=cap,pp1;
while(pp==1){
ccap--;
nr=1;
s=0;
pp1=1;
for(i=1;i<=n&&pp1==1;i++)
if(s+v[i]<=ccap)
s+=v[i];
else{
nr++;
if(nr>k)
pp1=0;
s=v[i];
}
if(k==nr&&pp1==1)
cap=ccap;
else
pp=0;
}
printf("%d",cap);
return 0;
}