【HDU 3507】Print Article(斜率优化DP)_hdu3507print article (斜率优化dp)-CSDN博客

本文链接：https://blog.csdn.net/hhaannyyii/article/details/78995086

Description

将一个序列分段，每一段的代价是这一段所有数字的和的平方加上一个给定的 $M$ ，求怎样分段代价最小。

Solution

斜率优化经典题。
状态转移方程不难想到：

d p i = m i n {d p j + (s u m i - s u m j) 2 + M 2}

$dp_i=min\{dp_j+(sum_i-sum_j)^2+M^2\}$
其中

sumi $sum_i$ 表示数列的前缀和。
然后直接斜率优化即可。。

Code

/**************************
Au: Hany01
Date: Jan 7th, 2018
Prob: hdu3507
Email: hany01@foxmail.com
**************************/

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

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Ha (1000000007)

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("hdu3507.in", "r", stdin);
    freopen("hdu3507.out", "w", stdout);
#endif
}

const int maxn = 500005;

struct Item
{
    int x, y;
    int id;
}q[maxn];

int n, m, Sum[maxn], dp[maxn], head, tail;

inline bool cmpslope1(int x1, int y1, int x2, int y2, int Sum) {
    if ((y2 - y1) < Sum * (x2 - x1)) return 1;
    return 0;
}

inline bool cmpslope2(int x1, int y1, int x2, int y2, int x3, int y3) {
    if ((y3 - y2) * (x2 - x1) <= (y2 - y1) * (x3 - x2)) return 1;
    return 0;
}

int main()
{
    File();
    while (scanf("%d%d", &n, &m) != EOF) {
        For(i, 1, n) Sum[i] = Sum[i - 1] + read();
        dp[0] = 0; head = tail = 0; q[head] = (Item){0, 0, 0};
        For(i, 1, n) {
            while (head < tail && cmpslope1(q[head].x, q[head].y, q[head + 1].x, q[head + 1].y, Sum[i])) ++ head;
            register int j = q[head].id;
            dp[i] = dp[j] + (Sum[i] - Sum[j]) * (Sum[i] - Sum[j]) + m;
            q[++ tail] = (Item){2 * Sum[i], dp[i] + Sum[i] * Sum[i], i};
            while (head + 1 < tail &&
                    cmpslope2(q[tail - 2].x, q[tail - 2].y, q[tail - 1].x, q[tail - 1].y, q[tail].x, q[tail].y))
                q[tail - 1] = q[tail], -- tail;
        }
        printf("%d\n", dp[n]);
    }
    return 0;
}
//荻花秋，潇湘夜，橘洲佳景如屏画。
//    -- 李珣《渔歌子·荻花秋》