书的复制 二分解法

谁都刷过的题，不贴了。

其实无论从算法还是数据范围来看这都是一道水题，但不过我原来只知道 dp 的做法。

今天写了一遍二分，感觉比 dp 要好得多。

Code :

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iostream>
#include <algorithm>

typedef int TYPE;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;

#define swap(a, b, t) ({t _ = (a); (a) = (b); (b) = _;})
#define MAX(a, b, t) ({t _ = (a), __ = (b); _ > __ ? _ : __;})
#define MIN(a, b, t) ({t _ = (a), __ = (b); _ < __ ? _ : __;})
#define max(a, b) ({TYPE _ = (a), __ = (b); _ > __ ? _ : __;})
#define min(a, b) ({TYPE _ = (a), __ = (b); _ < __ ? _ : __;})

#define maxn 555

typedef int arr[maxn];

int m, n;
arr a, b, c, s;

bool okay(int k)
{
    memset(b, 0, sizeof(arr));
    for (int i = n, j = m; ; -- i)
    {
        while (j and b[i] + a[j] <= k)
            b[i] += a[j --];
        c[i] = j + 1;
        if (j == 0) return 1;
        if (i == 1) return 0;
    }
}

void work()
{
    int l, r, mid;
    for (l = a[1], r = s[m]; l < r; )
        okay(mid = l + r >> 1) ? r = mid : l = mid + 1;
    okay(r), c[n + 1] = m + 1;
    for (int i = 1; i <= n; ++ i)
        printf("%d %d\n", c[i], c[i + 1] - 1);
}

void init()
{
    scanf("%d%d", & m, & n);
    for (int i = 1; i <= m; ++ i)
        scanf("%d", & a[i]), s[i] = s[i - 1] + a[i];
}

int main()
{
    freopen("book.in", "r", stdin);
    freopen("book.out", "w", stdout);
    
    init();
    work();
    
    return 0;
}

在看到有限制条件的最值问题时首当其冲想到二分啊。。。这是素质问题。。。