Pagini recente » Cod sursa (job #1765003) | Cod sursa (job #3229571) | Cod sursa (job #1369498) | Cod sursa (job #1615258) | Cod sursa (job #2066198)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[16005],sol,Max,s;
bool check(int x){
int V=0,r=0;
for(int i=0;i<n;i++){
r++;
V=0;
while(V+v[i]<=x)
V+=v[i++];
i--;
}
return (r<=k);
}
void c_bin(int l,int r){
if(l>=r)
return;
int mid=(l+r)/2;
if(check(mid)){
sol=mid;
c_bin(l,mid);
}else{
c_bin(mid+1,r);
}
}
int main(){
fin>>n>>k;
for(int i=0;i<n;i++){
fin>>v[i];
s+=v[i];
if(v[i]>Max)
Max=v[i];
}
c_bin(Max,s);
fout<<sol;
return 0;
}