Pagini recente » Cod sursa (job #89672) | Cod sursa (job #3218144) | Cod sursa (job #1100885) | Cod sursa (job #149806) | Cod sursa (job #3178713)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout ("transport.out");
int v[16001], n, k, maxi, s=0;
int cb(int k, int st, int dr, int n){
int mij, val=dr;
while(st<=dr){
mij = (st+dr)/2;
int s=0, t=0;
for (int i=1; i<=n; i++){
s+=v[i];
if (s>mij){
s=v[i];
t++;
}
}
t++;
if (t<=k){
dr = mij-1;
if (mij<val){
val = mij;
}
}
else if (t>k){
st = mij+1;
}
}
return val;
}
int main() {
fin >> n >> k;
for (int i=1; i<=n; i++){
fin >> v[i];
maxi = max(maxi, v[i]);
s+=v[i];
}
int rez = cb(k, maxi, s, n);
fout << rez;
return 0;
}