Pagini recente » Cod sursa (job #3360723) | Cod sursa (job #3360699) | Cod sursa (job #3360700) | Cod sursa (job #688644) | Cod sursa (job #3360474)
#include <stdio.h>
#include <stdbool.h>
#define NMAX 16000
int n, k, v[NMAX];
bool isValidSize(int cap) {
int i, tr, dim;
tr = 1;
dim = cap;
for (i = 0; i < n && tr <= k; i++) {
if (dim >= v[i]) {
dim -= v[i];
} else {
tr++;
dim = cap - v[i];
}
}
return tr <= k;
}
int binSearchSize(int max, int sum)
{
int st, dr, mij;
st = max - 1;
dr = sum;
while (dr - st > 1) {
mij = (st + dr) / 2;
if (isValidSize(mij)) {
dr = mij;
} else {
st = mij;
}
}
return dr;
}
int main()
{
int i, max, sum, ans;
FILE *fin = fopen("transport.in", "r");
FILE *fout = fopen("transport.out", "w");
fscanf(fin, "%d%d", &n, &k);
max = sum = 0;
for (i = 0; i < n; i++) {
fscanf(fin, "%d", &v[i]);
sum = sum+v[i];
if (max < v[i]) {
max = v[i];
}
}
ans = binSearchSize(max, sum);
fprintf(fout, "%d", ans);
fclose(fin);
fclose(fout);
return 0;
}