Cod sursa(job #1230307)
| Utilizator | Data | 18 septembrie 2014 13:49:00 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <cstdio>
using namespace std;
int v[16005],n,k;
int verif(int capac)
{
int i, nr=1 ,suma=0 ;
for(i=1;i<=n;i++)
{
if(v[i]>capac)
return 0;
if(suma+v[i]<=capac)
suma+=v[i];
else
{
nr++;
suma=v[i];
}
}
return nr<=k;
}
int main ()
{
int i,j,dev;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%D %D",&n,&k);
for(i=1;i<=n;i++)
scanf("%D",&v[i]);
i=0;
dev=1<<27;
while(dev)
{
if(!verif(i+dev))
i+=dev;
dev/=2;
}
printf("%d\n",i+1);
return 0;
}
