Cod sursa(job #1068308)
Utilizator | Data | 28 decembrie 2013 11:06:02 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | prega_28_dec | Marime | 0.64 kb |
//horatiu11
# include <cstdio>
# include <iostream>
# define nmax 16001
using namespace std;
int a[nmax],n,k;
int st,dr=nmax*nmax;
int main()
{
int i,sum,val,mij;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i)
{
scanf("%d",&a[i]);
st=max(st,a[i]);
}
while(st<=dr)
{
sum=0;val=1;
mij=(st+dr)>>1;
for(i=1;i<=n;++i)
if(sum+a[i]<=mij)sum+=a[i];
else sum=a[i],++val;
if (val>k)st=mij+1;
else dr=mij-1;
}
printf("%d\n",st);
return 0;
}