Cod sursa(job #285148)
Utilizator | Eugenie Daniel Posdarascu eudanip | Data | 22 martie 2009 13:32:05 |
---|---|---|---|
Problema | Transport | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<stdio.h>
int n,k,j,x[16001],mut;
long s,i,sf,in,m,lib;
int main ()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
for(j=1;j<=n;j++)
{
scanf("%d",&x[j]);
s=s+x[j];
}
i=s/k;
if(s%k>0)
i++;
in=0;
sf=n+1;
while(sf-in>1)
{
m=(i+s)/2;
mut=1;
lib=0;
for(j=1;j<=n;j++)
{
if(lib+x[j]<=m)
lib=lib+x[j];
else
{
mut++;
lib=x[j];
}
}//for
if(mut<=k)
{
sf=m;
s=m-1;
}
else
{
in=m;
i=m+1;
}//else
}
printf("%ld",sf);
return 0;
}