BZOj 1911 [斜率优化][DP]

最新推荐文章于 2020-02-21 23:30:46 发布

Vectorxj

最新推荐文章于 2020-02-21 23:30:46 发布

阅读量667

点赞数 2

分类专栏：动态规划文章标签： dp

本文链接：https://blog.csdn.net/Vectorxj/article/details/51851653

版权

动态规划专栏收录该内容

62 篇文章 0 订阅

订阅专栏

Description
这里写图片描述
Input

Output

首先能够很简单的得到DP方程：

d p i = m i n (d p j + F u n c (s u m i - s u m j))

$dp_i = min(dp_j + Func(sum_i - sum_j))$
设有

j $j$ ,

k $k$ 满足

j<k $j\lt k$ 且决策

j $j$ 比

k $k$ 更优，就相当于：

d p j - d p k + a * s u m 2 j - a * s u m 2 k + b * (s u m k - s u m j) - 2 a * (s u m j - s u m k) * s u m i > 0

$dp_j - dp_k + a * sum_j^2 - a * sum_k^2 + b * (sum_k - sum_j) - 2 a * (sum_j - sum_k) * sum_i > 0$ 移项得：

(f j - f k + a * (s u m 2 j - s u m 2 k) + b * (s u m k - s u m j)) / (2 a * (s u m j - s u m k)) > s u m i

$(f_j - f_k + a * (sum_j^2 - sum_k^2) + b * (sum_k - sum_j)) / (2a * (sum_j - sum_k)) > sum_i$ 设

f j + a * s u m 2 j - b * s u m j = y j

$f_j + a * sum_j^2 - b * sum_j = y_j$

f k + a * s u m 2 k - b * s u m k = y k

$f_k + a * sum_k^2 - b * sum_k = y_k$

2 a * s u m j = x j

$2a * sum_j = x_j$

2 a * s u m j = x k

$2a * sum_j = x_k$ 就得到了：

(y j - y k) / (x j - x k) > s u m i

$(y_j - y_k) / (x_j - x_k) > sum_i$ 这就是斜率，用单调队列维护即可。

#include <cstdio>
#include <cstdlib>
#include <iostream>
#define sqr(x) ((x) * (x))
#define N 1000010
using namespace std;
typedef long long ll;

ll sum[N], dp[N];
int q[N], x[N];
int h = 0, t = 0, a, b, c, n;

inline char get(void) {
  static char buf[1000000], *p1 = buf, *p2 = buf;
  if (p1 == p2) {
    p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin);
    if (p1 == p2) return EOF;
  }
  return *p1++;
}
inline void read(int &x) {
  x = 0; char c = get(); int sign = 1;
  for (; c < '0' || c > '9'; c = get()) if(c == '-') sign = 0;
  for (; c >= '0' && c <= '9'; x = (x << 1) + (x << 3) + c - '0', c = get());
  x = sign ? x : -x;
}
inline double slope(int k, int j) {
    return (double)(dp[j] - dp[k] + a * (sqr(sum[j]) - sqr(sum[k])) + b * (sum[k] - sum[j]))
        / (double)(2 * a *(sum[j] - sum[k]));
}
inline ll Func(ll x) {
    return a * sqr(x) + b * x + c;
}

int main(void) {
    read(n); read(a); read(b); read(c);
    for (int i = 1; i <= n; i++) {
        read(x[i]); sum[i] = sum[i - 1] + x[i];
    }
    for (int i = 1; i <= n; i++) {
        while (h < t && slope(q[h], q[h + 1]) < sum[i]) h++;
        int y = q[h];
        dp[i] = dp[y] + Func(sum[i] - sum[y]);
        while (h < t && slope(q[t - 1], q[t]) > slope(q[t], i)) t--;
        q[++t] = i;
    }
    cout << dp[n] << endl;
    return 0;
}