例题8-10 抄书（Copying Books, UVa 714）

思路：先二分求出最值，再由最值逆序进行区间划分，由k值补上额外划分。

#include <set>
#include <map>
#include <ctime>
#include <cmath>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define SF(a) scanf("%d", &a)
#define PF(a) printf("%d\n", a)  
#define SFF(a, b) scanf("%d%d", &a, &b)  
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SFFFF(a, b, c, d) scanf("%d%d%d%d", &a, &b, &c, &d)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 505
#define maxm 205
#define mod 1000000007
#define INF 1000000007
#define eps 1e-4
using namespace std;
int buf[20], l;
int read() {
	int x = 0; char ch = getchar(); bool f = 0;
	while (ch < '0' || ch > '9') { if (ch == '-') f = 1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}
void write(int x) {
	if (!x) { putchar(48); return; }
	l = 0; if (x < 0) putchar('-'), x = -x;
	while (x) buf[++l] = x % 10, x = x / 10;
	while (l) putchar(buf[l--] + 48);
}
//-------------------------CHC------------------------------//
int n, k;
int a[maxn];
bool cut[maxn];

bool check(int m) {
	int cnt = 0;
	int i = 0;
	while (i < n) {
		int sum = 0;
		while (i < n && sum + a[i] <= m) sum += a[i++];
		if (sum == 0) return false;
		++cnt;
	}
	return cnt <= k;
}

int main() {
	//IN(); OUT();
	int T;
	SF(T);
	while (T--) {
		SFF(n, k);
		FOR(i, 0, n) SF(a[i]);
		int l = 0, r = INF;
		while (r - l > 1) {
			int m = l + (r - l) / 2;
			//printf("l = %d, r = %d, m = %d\n", l, r, m);
			if (check(m)) r = m;
			else l = m;
		}
		CLEAR(cut, 0);
		int i = n - 1;
		while (i >= 0) {
			int sum = 0;
			while (i >= 0 && sum + a[i] <= r) sum += a[i--];
			if (i >= 0) cut[i] = true;
			--k;
		}
		for (int i = 0; i < n && k; ++i)
			if (!cut[i]) cut[i] = true, --k;
		FOR(i, 0, n - 1) {
			printf("%d ", a[i]);
			if (cut[i]) printf("/ ");
		}
		printf("%d\n", a[n - 1]);
	}
	return 0;
}