Pagini recente » Cod sursa (job #2187769) | Diferente pentru runda/12313415151518977 intre reviziile 1 si 3 | Diferente pentru runda/oni-2009-ix/clasament intre reviziile 3 si 4 | Cod sursa (job #2252414) | Cod sursa (job #1009544)
#include<stdio.h>
int main(){
int v[16001],nr,sum,s,l1,l2,k,n,i,x;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
s=0;
for(i=1;i<=n;i++){
scanf("%d",&v[i]);
s=s+v[i];
}
l1=1;
l2=s;
while(nr!=k&&l1!=l2){
nr=0;
i=1;
sum=0;
x=(l1+l2)/2;
while(i<=n){
if(sum+v[i]<=x)
sum=sum+v[i];
else{
nr++;
sum=v[i];
}
i++;
}
printf("%d\n",nr);
if(nr<k){
l2=(l1+l2)/2-1;
}
else
if(nr>k)
l1=(l1+l2)/2+1;
}
//while(nr==k){
// sum=0;
// x--;
// for(i=1;i<=n;i++)
//
// if(sum+v[i]<=x)
// sum=sum+v[i];
// else{
// nr++;
// sum=v[i];
// }
//}
printf("%d",x+1);
return 0;
}