Cod sursa(job #1591358)
| Utilizator | Data | 6 februarie 2016 09:55:25 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva de probleme | Marime | 0.81 kb |
#include <stdio.h>
#include <stdlib.h>
long long n, k, i, st, dr, mij, v[16010], s, nr, x, maxim;
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%lld%lld",&n,&k);
for(i=1;i<=n;i++){
scanf("%lld",&v[i]);
if(maxim<v[i])
maxim=v[i];
}
st=maxim;
dr=256000000;
while(st<=dr){
nr=1;
mij=(st+dr)/2;
for(i=1;i<=n;i++){
s+=v[i];
if(s>mij){
nr++;
s=v[i];
}
}
if(s<=mij){
if(nr==k)
x=mij;
if(nr>k)
st=mij+1;
else
dr=mij-1;
s=0;
}
}
printf("%lld",st);
return 0;
}
