【BZOJ1150】【CTSC2007】数据备份（DP，凸优化）

Description

https://www.lydsy.com/JudgeOnline/problem.php?id=1150

---

Solution

凸优化入门题。
（其实可以用BZOJ2151种树的方法解决）

$O(n^2)$的DP很容易想到，我们发现随着$K$的增大，答案也在增大，且增长的幅度越来越大，是一个凸的。所以我们可以二分一个值，无视$K$的限制直接DP，每次新连一条线时就将答案减去该值即可。

---

Code

/**************************************
 * Au: Hany01
 * Prob: [BZOJ1150][APIO2007] 数据备份
 * Date: Aug 11th, 2018
 * Email: hany01@foxmail.com
**************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<LL, int> PII;
typedef vector<int> VI;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#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 SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define x first
#define y second
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define y1 wozenmezhemecaia 
#ifdef hany01
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif

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 char c_; register int _, __;
    for (_ = 0, __ = 1, c_ = getchar(); !isdigit(c_); c_ = getchar()) if (c_ == '-')  __ = -1;
    for ( ; isdigit(c_); c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1e5 + 5;

int n, s[maxn];
PII ANS;

inline void DP(int dt) {
    static PII f[2][maxn];
    f[0][1] = mp(0, 0); //make_pair(minimum length, the number of used lines)
    f[1][1] = mp(INF, INF);
    For(i, 2, n)
        f[0][i] = min(f[0][i - 1], f[1][i - 1]),
        f[1][i] = mp(f[0][i - 1].x + s[i] - s[i - 1] - dt, f[0][i - 1].y + 1);
    ANS = min(f[0][n], f[1][n]);
}

int main()
{
#ifdef hany01
    File("bzoj1150");
#endif

    static int k, l, r, mid;

    n = read(), k = read();
    For(i, 1, n) s[i] = read();

    for (l = 0, r = s[n]; l < r; ) {
        mid = (l + r + 1) >> 1, DP(mid);
        if (ANS.y <= k) l = mid; else r = mid - 1;
    }
    DP(l), cout << ANS.x + (LL)l * k << endl;

    return 0;
}