Cod sursa(job #1132534)
Utilizator | Data | 3 martie 2014 16:29:55 | |
---|---|---|---|
Problema | Transport | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <stdio.h>
int v[16001];
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,k,max=0,l1,l2,s=0,mij,i,cate,mink=16001;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++){
scanf("%d",&v[i]);
if(v[i]>max)
max=v[i];
s+=v[i];
}
l1=1;
l2=s;
while(l1<=l2){
mij=(l1+l2)/2;
cate=1;
s=0;
for(i=1;i<=n;i++)
if(s+v[i]<=mij)
s+=v[i];
else{
cate++;
s=v[i];
}
if(cate<=k){
mink=mij;
l2=mij-1;
}
else
l1=mij+1;
}
printf("%d",mink);
return 0;
}