POJ 3245|Sequence Partitioning|动态规划|单调队列

题意真是难懂。。

题意

一个长度为$N$的序列（每个元素是$(a_i,b_i)$这样的数对），连续地分成若干组。每组左右边界是$(l_1,r_1),(l_2,r_2),\cdots,(l_p,r_p)$，满足$l_i = r_{i − 1} + 1, l_i ≤ r_i, l_1 = 1, r_p = n$。分组必须满足两个条件：前面组的元素的$b$值比后面组元素的$a$值大；令$M_i$为第$i$个组内最大的$a$，所有$M_i$的和不超过$limit$。令$S_i$为第$i$个组的元素的$b$的和，最小化$\max\{S_i\}$。

题解

二分答案。
能否破除$b$和$a$的关系呢？
考虑什么情况下必须捆绑在一起。
如果$a_i>b_j$，那么任意$b_k\leq b_j$，都必须与$a_i$捆绑在一起，否则不符合题意。
所以考虑排序$b_j$，然后从大到小扫。
然后剩下的就没有限制了，于是问题就变成，给出一个数列，(每个组a的最大值)的和不能超过limit，(各组内b的的和)的最大值最小。
那么和POJ 3017很类似了？
一个单调队列优化DP
不过POJ 3017必须要set维护，本题就无所谓了。。

代码

#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 50005, inf = 0x7fffffff;
int n, limit, q[N], a[N], b[N], dp[N], p1[N], p2[N];
bool check(int m) {
    int i, j = 1, k, s = 0, f = 0, r = 0;
    for (i = 1; i <= n; ++i) {
        s += b[i];
        while (s > m) s -= b[j++];
        if (j > i) return 0;
        while (f < r && a[q[r - 1]] <= a[i]) --r;
        while (f < r && q[f] < j) ++f;
        q[r++] = i;
        dp[i] = dp[j - 1] + a[q[f]];
        for (k = f + 1; k < r; ++k)
            dp[i] = min(dp[i], dp[q[k - 1]] + a[q[k]]);
    }
    return dp[n] <= limit;
}
bool cmp(int x, int y) {
    return b[x] < b[y];
}
int main() {
    int i, j, l, r, mid;
    while (scanf("%d%d", &n, &limit) == 2) {
        for (i = 1; i <= n; ++i)
            scanf("%d%d", &a[i], &b[i]), p1[i] = p2[i] = i;
        sort(p1 + 1, p1 + n + 1, cmp);
        for (j = 1, i = n; i >= 1; --i)
            for (; j <= n && b[p1[j]] <= a[i]; ++j)
                p2[p1[j]] = i;
        for (i = 1, j = 1; i <= n; i = l, ++j) {
            a[j] = a[i]; b[j] = b[i];
            for (l = i + 1, r = max(p2[i], i); l <= r; ++l) {
                a[j] = max(a[j], a[l]);
                b[j] += b[l];
                r = max(r, p2[l]);
            }
        }
        n = j - 1;
        for (l = 0, r = inf; l < r) {
            mid = l + r >> 1;
            if (check(mid)) r = mid;
            else l = mid + 1;
        }
        printf("%d\n", l);
    }
    return 0;
}

Sequence Partitioning

Time Limit: 8000MS Memory Limit: 65536K
Total Submissions: 1286 Accepted: 346
Case Time Limit: 5000MS

Description

Given a sequence of $N$ ordered pairs of positive integers $(A_i, B_i)$, you have to partition it into several contiguous parts. Let $p$ be the number of these parts, whose boundaries are $(l_1, r_1), (l_2, r_2), ... ,(l_p, r_p)$, which satisfy $l_i = r_{i − 1} + 1, l_i ≤ r_i, l_1 = 1, r_p = n$. The parts themselves also satisfy the following restrictions:

For any two pairs $(A_p, B_p), (A_q, B_q)$, where $(A_p, B_p)$ is belongs to the $T_p$th part and $(A_q, B_q)$ the $T_q$th part. If $T_p < T_q$, then $B_p > A_q$.

Let $M_i$ be the maximum A-component of elements in the $i$th part, say

$M_i = \max\{A_{l_i}, A_{l_{i+1}}, \cdots, A_{r_i}\}, 1 ≤ i ≤ p$

it is provided that

$$\sum_{i=1}^p M_i\leq Limit$$

where Limit is a given integer.

Let $S_i$ be the sum of $B$-components of elements in the $i$th part. Now I want to minimize the value

$$\max\{S_i:1 ≤ i ≤ p\}$$

Could you tell me the minimum?

Input

The input contains exactly one test case. The first line of input contains two positive integers $N (N ≤ 50000), Limit (Limit ≤ 2^{31}-1)$. Then follow $N$ lines each contains a positive integers pair (A, B). It’s always guaranteed that

$\max\{A_1, A_2, \cdots, A_n\} ≤ Limit$

Output

Output the minimum target value.

Sample Input

4 6
4 3
3 5
2 5
2 4

Sample Output

9

Hint

An available assignment is the first two pairs are assigned into the first part and the last two pairs are assigned into the second part. Then $B_1 > A_3, B_1 > A_4, B_2 > A_3, B_2 > A_4, \max\{A_1, A_2\}+\max\{A_3, A_4\} ≤ 6$, and minimum $\max\{B_1+B_2, B_3+B_4\}=9$.

Source

POJ Monthly–2007.07.08, Chen, Danqi