Uva714-copying books (minimized maximum value)

Meaning: K pieces of books are divided into M parts to minimize the sum of each part.

Idea: Use greedy + binary to minimize the typical maximum value. Greedy is that each time we try to divide the elements to the right, the minimum X of the Binary Search satisfies M consecutive subsequences and S (I) cannot exceed X.

Because of the output, we try to divide the data from the back to the back when dividing the data.

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int MAXN = 1005;int m, k, t;int arr[MAXN], vis[MAXN];ll ans, sum, Min;int judge(ll x) {    memset(vis, 0, sizeof(vis));    ll s = 0;    t = 0;    int flag = 1;    for (int i = m - 1; i >= 0; i--) {        if (arr[i] > x) {            flag = 0;             break;        }         if (s + arr[i] > x) {            vis[i] = 1;            t++;            s = arr[i];            if (t > k - 1) {                flag = 0;                 break;            }          }        else              s += arr[i];       }        return flag;}int binary() {    ll x = Min, y = sum;    while (x < y) {        ll mid = x + (y - x) / 2;        if (judge(mid))             y = mid;        else            x = mid + 1;     }    return x;}void outPut() {    judge(ans);    int num = k - 1 - t;    for (int i = 0; i < m; i++) {        if (vis[i] == 0 && num) {            vis[i] = 1;             num--;         }    }     for (int i = 0; i < m - 1; i++) {        printf("%d ", arr[i]);        if (vis[i])             printf("/ ");     }     printf("%d\n", arr[m - 1]);}int main() {    int cas;    scanf("%d", &cas);    while (cas--) {        scanf("%d %d", &m, &k);                 ans = 0;        Min = arr[0];        for (int i = 0; i < m; i++) {            scanf("%d", &arr[i]);             sum += arr[i];             if (Min < arr[i])                Min = arr[i];        }        ans = binary();        outPut();    }      return 0;}