Pagini recente » Cod sursa (job #910895) | Cod sursa (job #1749491) | Cod sursa (job #2008011) | Cod sursa (job #1324554) | Cod sursa (job #1278730)
#include<stdio.h>
using namespace std;
int v[16001];
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,k,maxi,lmax,lmin,i,nrt,c,l1,l2,lm,m;
maxi=0;
lmax=0;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
for(i=1;i<=n;i++){
lmax=lmax+v[i];
if(v[i]>maxi)
maxi=v[i];
}
lmin=maxi;
l1=lmin;
l2=lmax;
while(l1<=l2){
c=0;
nrt=1;
m=(l1+l2)/2;
for(i=1;i<=n;i++){
if(c+v[i]<=m)
c=c+v[i];
else{
nrt++;
c=v[i];
}
}
if(nrt<=k){
l2=m-1;
lm=m;
}
else
l1=m+1;
}
printf("%d",lm);
return 0;
}