arc073 F many moves(dp + 线段树)

设dp[i][y]表示一个点在x[i],另一个点在y时最小要走的步数

那么有以下转移

对于y != x[i-1]的状态，可以证明，他们直接加|x[i] - x[i-1]|即可（如果有其他方案，不符合对dp的定义）

当y == x[i-1]时，它可以由其他所有状态转移过来， dp[i][x[i-1]] = min(dp[i][y] + |y - x[i]|)

把绝对值拆出来，就是需要维护一个dp[i][y] + y 和dp[i][y] - y，建立两个线段树即可。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long LL;
const int maxn = 2e5 + ;
LL Plus[maxn*], Minus[maxn*], tag[maxn*];
inline LL abs(LL x) { return x <  ? -x : x; }
inline void Puttag(int o, LL v){
    Plus[o] += v;
    Minus[o] += v;
    tag[o] += v;
}
inline void Pushdown(int o){
    if(!tag[o]) return;
    Puttag(o*, tag[o]);
    Puttag(o*+, tag[o]);
    tag[o] = ;
}
inline void Maintain(int o){
    Plus[o] = min(Plus[o*], Plus[o*+]);
    Minus[o] = min(Minus[o*], Minus[o*+]);
}
inline bool Cut(int x) { return false; }
inline bool Check(int x) { return true; }
inline void Change(int o, int l, int r, int L, int R, LL v){
    if(L > r || R < l || Cut(o)) return;
    if(L <= l && r <= R && Check(o)){
        Puttag(o, v); return;
    }
    int mid = (l+r)/; Pushdown(o);
    Change(o*, l, mid, L, R, v);
    Change(o*+, mid+, r, L, R, v);
    Maintain(o);
}
inline long long Query(int o, int l, int r, int L, int R, int ty){
    if(L > r || R < l || Cut(o)) return 1e18;
    if(L <= l && r <= R){
        return ty ? Plus[o] : Minus[o];
    }
    int mid = (l+r)/; Pushdown(o);
    ans = min(Query(o*+, mid+, r, L, R, ty), Query(o*, l, mid, L, R, ty));
    Maintain(o);
    return ans;
}
inline void Insert(int o, int l, int r, int k, LL v, int ty){
    if(l == r) {
        if(ty) Plus[o] = v; else Minus[o] = v;
        return;
    }
    int mid = (l+r)/; Pushdown(o);
    if(k <= mid) Insert(o*, l, mid, k, v, ty);
    else Insert(o*+, mid+, r, k, v, ty);
    Maintain(o);
}

int N, Q, A, B;
int x[maxn];
int main(){
    scanf("%d %d %d %d", &N, &Q, &A, &B);
    for(int i = ; i <= Q; i++) scanf("%d", &x[i]);
    x[] = B;
    // dp[i][x] = dp[i-1][x] + ||
    // dp[i][x[i-1]] = all(dp[i-1][x]+|x-x[i]|)
    // x <= x[i] -> dp[i-1][x] + x[i] - x
    // x > x[i] -> dp[i-1][x] + x - x[i]
    memset(Plus, , sizeof(Plus));
    memset(Minus, , sizeof(Minus));
    Insert(, , N, A, A, );
    Insert(, , N, A, -A, );
    for(int i = ; i <= Q; i++){
        LL ans = min(Query(, , N, , x[i], ) + x[i], Query(, , N, x[i]+, N, ) - x[i]);
        Change(, , N, , x[i-]-, abs(x[i] - x[i-]));
        Change(, , N, x[i-]+, N, abs(x[i] - x[i-]));

        Insert(, , N, x[i-], ans + x[i-], );
        Insert(, , N, x[i-], ans - x[i-], );
    }
    LL ans = 1e18;
    for(int i = ; i <= N; i++){
        ans = min(ans, Query(, , N, i, i, ) + i);
    }
    cout<<ans<<endl;
}