[BZOJ1010]玩具装箱toy

题目链接：BZOJ1010

题目大意
把$N$个数分成若干段，从$i$到$j$分为一段的花费$cost[i][j] = \sum_{k=i}^{j}val[k]+j-i$，求最小花费。

分析
1. 斜率优化DP，$dp[i] = min(dp[j] + cost[j + 1][i])$。
2. 先把$L+1$，设$f(x) = \sum_{k=1}^{x}val[k]+x$，$ff(x) = dp[x]+f(x)^2$，$g[i,j]=\frac{ff(i)-ff(j)}{f(i)-f(j)}$。
3. 则维护一个下凸的解集，且维护斜率大于两倍的$f(i)-L$。

上代码

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef double DB;
typedef long long LL;
const int N = 5e4 + 10;

int n, L;
LL sum[N], dp[N];

inline int read() {
    int ans = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar();
    while (ch >= '0' && ch <= '9')
        ans = ans * 10 + ch - '0', ch = getchar();
    return ans;
}

int head, tail, val[N];
inline void clear() { head = tail = 0; }
inline void pop_back() { tail--; }
inline void pop_front() { head++; }
inline void push(int a) { val[tail++] = a; }
inline int size() { return tail - head; }

#define p(a) ((a) * (a))
#define f(a) (sum[a] + (a))
#define ff(a) (dp[a] + p(f(a)))
inline DB calcK(int a, int b) { //因为我懒，就没写通分了
    return (DB)(ff(a) - ff(b)) / (f(a) - f(b));
}
int main() {
    n = read(), L = read() + 1;
    for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + read();
    clear(), push(0);
    for (int i = 1; i <= n; i++) {
        LL k = f(i) - L;
        while (size() >= 2 && calcK(val[head], val[head + 1]) <= (DB)k * 2)
            pop_front();
        dp[i] = ff(val[head]) - f(val[head]) * k * 2 + p(k);
        while (size() >= 2 && calcK(val[tail - 1], val[tail - 2]) >= calcK(i, val[tail - 1]))
            pop_back(); push(i);
    }
    printf("%lld\n", dp[n]);
    return 0;
}

以上