bzoj 1049 [HAOI2006]数字序列

找到的题解

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define rep2(i,k,n) for(int i=k;i>=n;i--)
using namespace std;
const int inf = 0x3f3f3f3f;
typedef long long ll;
const int maxn = 40000;
int a[maxn], f[maxn], tot = 0, head[maxn], n;
ll g[maxn],sl[maxn], sr[maxn];
struct E {
    int to, next;
    E(int to = 0, int next = 0): to(to), next(next) {}
} edge[500000];
void add(int x, int y) {
    edge[++tot] = E(y, head[x]);
    head[x] = tot;
}
void solve1() {
    memset(g, 0x7f, sizeof(g));
    g[0] = -inf;
    rep(i, 1, n) {
        f[i] = lower_bound(g, g + n + 1, a[i]) - g;

        if(g[f[i]] == a[i]) {
            f[i]++;
            g[f[i]] = a[i];
        }

        g[f[i]] = a[i];
    }
    printf("%d\n", n - f[n]);
    rep(i, 0, n)
    add(f[i], i);
}
void solve2() {
    memset(g, 0x7f, sizeof(g));

    g[0]=0;

    rep(i, 1, n)

    for(int j = head[f[i] - 1]; j; j = edge[j].next) {
        int v = edge[j].to;

        if(v > i || a[v] > a[i])continue;

        rep(k, v, i){
        sl[k] = abs(a[k] - a[v]);sr[k] = abs(a[k] - a[i]);}
        rep(k, v + 1, i){
        sl[k] += sl[k - 1];sr[k] += sr[k-1];}
        rep(k, v, i)
        g[i] = min(g[i], g[v] + sl[k]-sl[v]+sr[i]-sr[k]);
    }

    printf("%lld\n", g[n]);
}
int main() {
//    freopen("in.in", "r", stdin);
    scanf("%d", &n);
    rep(i, 1, n) {
        scanf("%d", &a[i]);
        a[i] -= i;
    }
    a[++n] = inf;a[0]=-inf;
    solve1();
    solve2();
    return 0;
}