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