Cod sursa(job #813336)
Utilizator | Data | 15 noiembrie 2012 11:15:43 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.71 kb |
#include<stdio.h>
int main(){
int s,max,n,k,saux,tr,l1,l2,v[16001],m,i;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
s=0;
max=0;
for(i=1;i<=n;i++){
scanf("%d",&v[i]);
s+=v[i];
if(v[i]>max)
max=v[i];
}
l1=max;
l2=s;
tr=0;
while(tr!=k){
m=(l1+l2)/2;
saux=0;tr=0;
for(i=1;i<=n;i++)
if(saux+v[i]<=m)
saux+=v[i];
else{
tr++;
saux=0;
s+=v[i];
}
tr++;
if(tr<k)
l2=(l1+m)/2;
}
printf("%d",m);
return 0;
}