Pagini recente » Cod sursa (job #120024) | Cod sursa (job #99794) | Cod sursa (job #2367668) | Cod sursa (job #3233533) | Cod sursa (job #555913)
Cod sursa(job #555913)
#include<cstdio>
#include<algorithm>
#define Nmax 16010
using namespace std;
int N,K,vol[Nmax],val_max,suma,sol,cap;
bool posibil(int c){
int s=0,t=1;
for(int i=1;i<=N&&t<=K;++i){
if(s+vol[i]<=c)
s+=vol[i];
else
s=vol[i],
t++;
}
if(t>K)
return 0;
return 1;
}
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&N,&K);
for(int i=1;i<=N;++i)
scanf("%d",&vol[i]),
val_max=max(val_max,vol[i]),
suma+=vol[i];
int p=val_max,u=suma;
while(p<=u){
cap=(p+u)/2;
if(posibil(cap))
sol=cap,
u=cap-1;
else p=cap+1;
}
printf("%d",sol);
}