Pagini recente » Cod sursa (job #1728126) | Istoria paginii runda/emag_2016-incepatori-1 | Cod sursa (job #315946) | Istoria paginii utilizator/cristinadoroftei | Cod sursa (job #1708139)
#include <cstdio>
using namespace std;
const int NMAX=16000;
int v[NMAX+5];
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,i,s,k,med,st,dr,tr,sum,last,c;
scanf("%d%d",&n,&k);
s=0;
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
s=s+v[i];
}
st=1;dr=s;
while(st<=dr)
{
med=(st+dr)/2;
c=med;tr=0;sum=0;
for(i=1;i<=n;i++)
{
if(v[i]>c)
{
tr=k+1;sum=0;
break;
}
if(sum+v[i]>c)
{
tr++;
sum=v[i];
}
else
sum=sum+v[i];
}//for
if(sum>0)
tr++;
if(tr<=k)
{
last=med;
dr=med-1;
}
else
st=med+1;
}
printf("%d\n",last);
return 0;
}