Pagini recente » Cod sursa (job #1585731) | Cod sursa (job #1269696) | Cod sursa (job #43271) | Cod sursa (job #888678) | Cod sursa (job #1600560)
#include <cstdio>
#include <vector>
using namespace std;
vector<int>v;
int k;
bool ok(int max_val){
int i, sum = 0, nr_trans = 1;
for(i=0; i<(int)v.size(); ++i){
if(sum + v[i] <= max_val)
sum += v[i];
else{
sum = v[i];
nr_trans++;
}
}
return nr_trans <= k;
}
int main()
{
int i, n, x, st, dr, med, rez, sum=0, max=0;
freopen("transport.in","r",stdin);
freopen("transport.out","w", stdout);
scanf("%d%d",&n,&k);
for(i=1; i<=n; ++i){
scanf("%d",&x);
v.push_back(x);
if(x > max)
max = x;
sum += x;
}
st = max;
dr = sum;
while(st <= dr){
med = (dr + st)/2;
if(ok(med)){
dr = med - 1;
rez = med;
}
else
st = med + 1;
}
printf("%d",rez);
return 0;
}