Pagini recente » Cod sursa (job #297974) | Cod sursa (job #355183) | Cod sursa (job #2011693) | Cod sursa (job #1915033) | Cod sursa (job #2929048)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, v[16005], k;
int nr_drumuri(int capacitate){
int s=0, nr=1;
for(int i=1;i<=n;i++){
if(s+=v[i]<=capacitate){
s+=v[i];
}else{
nr++;
s=0;
}
}
return nr;
}
int main(){
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>v[i];
}
long long st=-1, dr=16000*16000, mij, sol=0;
for(int i=1;i<=n;i++){
st=max((long long)v[i], st);
}
while(st<=dr){
mij=(st+dr)/2;
if(nr_drumuri(mij)>k){
st=mij+1;
}else{
sol=mij;
dr=mij-1;
}
}
fout<<sol;
return 0;
}