Pagini recente » Cod sursa (job #2958447) | Cod sursa (job #487412) | Cod sursa (job #2851439) | Cod sursa (job #3219703) | Cod sursa (job #1591358)
#include <stdio.h>
#include <stdlib.h>
long long n, k, i, st, dr, mij, v[16010], s, nr, x, maxim;
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%lld%lld",&n,&k);
for(i=1;i<=n;i++){
scanf("%lld",&v[i]);
if(maxim<v[i])
maxim=v[i];
}
st=maxim;
dr=256000000;
while(st<=dr){
nr=1;
mij=(st+dr)/2;
for(i=1;i<=n;i++){
s+=v[i];
if(s>mij){
nr++;
s=v[i];
}
}
if(s<=mij){
if(nr==k)
x=mij;
if(nr>k)
st=mij+1;
else
dr=mij-1;
s=0;
}
}
printf("%lld",st);
return 0;
}