【SDUTOJ 2414】 :An interesting game 网络流

传送门

题意

分析

这个数据范围很小，可以考虑用网络流处理
我们把$0-30$这个范围内每一个值和每一个位置连边，流量为1，费用为该变量，然后设置虚拟原点控制流量，跑最小费用最大流即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = 1e6 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],ne[M],e[M],w[M],f[M],idx;
int n,m,S,T,k;
int q[N],d[N],pre[N],incf[N];
bool st[N];
int a[N];

void init(){
    for(int i = 0;i <= n + 100;i++) h[i] = -1,st[i] = 0,pre[i] = 0;
    idx = 0;
}

void add(int a,int b,int c,int d){
    ne[idx] = h[a],e[idx] = b,f[idx] = c,w[idx] = d,h[a] = idx++;
    ne[idx] = h[b],e[idx] = a,f[idx] = 0,w[idx] = -d,h[b] = idx++;
}

bool spfa(){
    int hh = 0,tt = 1;
    memset(d,0x3f,sizeof d);
    memset(incf,0,sizeof incf);
    q[0] = S,d[S] = 0,incf[S] = INF;
    while(hh != tt){
        int t = q[hh++];
        if(hh == N) hh = 0;
        st[t] = false;
        for(int i = h[t];~i;i = ne[i]){
            int ver = e[i]; 
            if(f[i] && d[ver] > d[t] + w[i]){
                pre[ver] = i;
                d[ver] = d[t] + w[i];
                incf[ver] = min(f[i],incf[t]);
                if(!st[ver]){
                    q[tt++] = ver;
                    if(tt == N) tt = 0;
                    st[ver] = true;
                }
            }
        }
    }
    return incf[T] > 0;
}

void EK(int &flow,int &cost){
    flow = cost = 0;
    while(spfa()){
        int t = incf[T];
        flow += t,cost += t * d[T];
        for(int i = T;i != S;i = e[pre[i] ^ 1]){
            f[pre[i]] -= t;
            f[pre[i] ^ 1] += t;
        }
    }
}

int main() {
    int num;
    read(num);
    for(int pppp = 1;pppp <= num;pppp++){
        printf("Case %d: ",pppp);
        read(n),read(m),read(k);
        init();
        for(int i = 1;i <= n;i++) read(a[i]);
        S = 0;
        int s = n + 51;
        T = n + 50;
        add(S,s,k,0);
        for(int i = 1;i <= m;i++) {
            int x;
            read(x);
            add(s,n + x + 1,1,0);
        }
        int ans = 0;
        for(int i = 1;i < n;i++){
            ans += abs(a[i + 1] - a[i]);
            for(int j = 0;j <= 30;j++){
                add(n + j + 1,i,1,abs(a[i + 1] - a[i]) - abs(j - a[i]) - abs(j - a[i + 1]));
            }
            add(i,T,1,0);
        }
        int flow,cost;
        EK(flow,cost);
        di(ans - cost);
    }
    return 0;
}