Pagini recente » Cod sursa (job #2971503) | Cod sursa (job #651076) | Cod sursa (job #521854) | Cod sursa (job #520760) | Cod sursa (job #1828419)
#include <cstdio>
#include <string.h>
using namespace std;
int v[16005],n,k;
int check(int val){
int i;
int ret = 0;
int sum = 0;
for(i = 1;i <= n;i++){
sum += v[i];
if(sum > val){
sum = v[i];
ret++;
}
}
ret++;
return ret;
}
int binarySearch(int lf, int rg){
int i,step;
for(step = 1;step <= rg;step <<= 1);
step--;
for(i = step;step;step >>= 1){
if(i - step <= rg && check(i - step) <= k){
i -= step;
}
}
return i;
}
int main()
{
freopen("transport.in", "r", stdin);
freopen("transport.out", "w", stdout);
int i,l,sum;
scanf("%d %d", &n, &k);
for(i = 1;i <= n;i++){
scanf("%d", &v[i]);
sum += v[i];
}
printf("%d", binarySearch(1, 2000000000));
return 0;
}