本文共 1558 字，大约阅读时间需要 5 分钟。
#include#include #include #define REP(i, a, b) for(int i = (a); i < (b); i++)using namespace std;typedef long long ll;const int MAXN = 512;int a[MAXN], board[MAXN], n, k;bool judge(ll key){ ll num = 1, sum = 0; REP(i, 0, n) { if(sum + a[i] <= key) sum += a[i]; else { num++; sum = a[i]; if(num > k) return false; } } return true;}void print(ll key){ memset(board, 0, sizeof(board)); ll sum = 0, remain = k; for(int i = n - 1; i >= 0; i--) { if(sum + a[i] > key || i + 1 < remain) sum = a[i], board[i+1] = 1, remain--; else sum += a[i]; } printf("%d", a[0]); REP(i, 1, n) { if(board[i]) printf(" /"); printf(" %d", a[i]); } puts("");}int main(){ int T; scanf("%d", &T); while(T--) { ll l = 0, r = 0; scanf("%d%d", &n, &k); REP(i, 0, n) scanf("%d", &a[i]), r += a[i], l = max(l, (ll)a[i]); l--; while(l + 1 < r) { ll mid = (l + r) / 2; if(judge(mid)) r = mid; else l = mid; } print(r); } return 0; }
转载地址：http://rwyhz.baihongyu.com/