Pagini recente » Cod sursa (job #1270642) | Cod sursa (job #1317612) | Cod sursa (job #2894006) | Cod sursa (job #1829343) | Cod sursa (job #1007455)
#include <iostream>
#include <fstream>
#define nmax 16001
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int n,k,maxim=0,hi,lo,i,num,mid,vol,s=0,middle;
int v[nmax];
bool ok;
int main(){
in >> n >> k;
for (i=1; i<=n; i++){
in >> v[i];
maxim=max(v[i], maxim);
s+=v[i];
}
hi=s;
lo=maxim;
while (hi-lo>1){
mid=(hi+lo)/2;
num=0;
vol=0;
for (i=n; i>0; i--){
ok=true;
if (vol<mid && vol+v[i]<=mid) vol+=v[i];
else num++, vol=v[i], ok=false;
if (i==1 && ok) num++;
}
if (num<=k) hi=mid, maxim=mid;
else lo=mid;
}
out << maxim;
return 0;
}