Pagini recente » Cod sursa (job #2533967) | Cod sursa (job #2401539) | Cod sursa (job #1009251) | Cod sursa (job #1142570) | Cod sursa (job #318093)
Cod sursa(job #318093)
#include <stdio.h>
#define N 16000
int n,k,v[N],vmax,s;
void read()
{
scanf("%d%d",&n,&k);
int i;
for (i=1; i<=n; i++)
{
scanf("%d",&v[i]);
s+=v[i];
if (v[i]>vmax)
vmax=v[i];
}
}
int rezolva(int m)
{
int i,op=0,sact=0;
for (i=1; i<=n; i++)
{
if (sact+v[i]<=m)
sact+=v[i];
else
{
op++;
sact=0;
}
}
return op+1;
}
int cbin()
{
int st=vmax,dr=s,m,rez;
while (st!=dr)
{
m=(st+dr)/2;
rez=rezolva(m);
if (rez<=k)
dr=m;
else
st=m+1;
}
if (rezolva(st)<=k)
return st;
return st-1;
}
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
read();
//printf("%d",rezolva(10));
printf("%d\n",cbin());
return 0;
}