Pagini recente » Cod sursa (job #3178535) | Cod sursa (job #3265562) | Cod sursa (job #633272) | Cod sursa (job #1007473) | Cod sursa (job #741622)
Cod sursa(job #741622)
#include <stdio.h>
int v[16001];
int main()
{
int n=0,i=0,start=0,mid=0,stop=0,t=1,k=0,x=0,rez=0,j=0;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
for (i=0; i<n; ++i)
{
scanf("%d",&v[i]);
stop+=v[i];
if (v[i]>start)
start=v[i];
}
if (n<50)
for (i=start; i<stop+1; ++i)
{
x=i;
t=1;
for (j=0; j<n; ++j)
if (x>=v[j])
x-=v[j];
else
{
++t;
x=i-v[j];
}
if (t<=k)
{
rez=i;
i=stop+2;
}
}
else
{
while(stop>start)
{
mid=(stop+start)/2;
x=mid;
for (i=0; i<n; ++i)
if (x>=v[i])
x-=v[i];
else
{
++t;
x=mid-v[i];
}
if(t>k)
start=mid+1;
else
{
stop=mid-1;
rez=mid;
}
t=1;
}
--rez;
x=rez;
for (i=0; i<n; ++i)
{
if (x>=v[i])
x-=v[i];
else
{
++t;
x=rez-v[i];
}
}
if (t>k)
++rez;
}
printf("%d",rez);
return 0;
}