[BZOJ1061][Noi2008]志愿者招募

原题地址

BYVOID犇题解:https://www.byvoid.com/blog/noi-2008-employee/

太神了OLZ
膜BYVOID大神OLZ

MS这题是GX省选必考题，GX的注意了233

AC code:

#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
const int N=10010;
const int INF=1<<28;
int n,m,S,T,ans;
int d[N],s[N],t[N],c[N];

struct Edge{
    int u,v,c,f,a;

    Edge(int u,int v,int c,int f,int a):u(u),v(v),c(c),f(f),a(a) {}
};
vector<Edge> E;
vector<int> G[N];

void addedge(int u,int v,int c,int a){
    E.push_back(Edge(u,v,c,0,a));
    E.push_back(Edge(v,u,c,c,-a));
    G[u].push_back(E.size()-2);
    G[v].push_back(E.size()-1);
}

void read(){
    scanf("%d%d",&n,&m);
    S=n+2;T=S+1;
    for(int i=1;i<=n;i++) scanf("%d",&d[i]);
    for(int i=1;i<=m;i++) scanf("%d%d%d",&s[i],&t[i],&c[i]);
    for(int i=1;i<=m;i++) addedge(s[i],t[i]+1,INF,c[i]);
    for(int i=2;i<=n+1;i++) addedge(i,i-1,INF,0);
    for(int i=1;i<=n+1;i++){
        if(d[i]-d[i-1]<0) addedge(i,T,d[i-1]-d[i],0);
        else addedge(S,i,d[i]-d[i-1],0);
    }
}

bool SPFA(){
    queue<int> Q;
    int  flow=INF;
    int  mina[N],num[N];
    bool inq[N]={0};

    for(int i=1;i<=T;i++) mina[i]=INF;
    mina[S]=0;
    Q.push(S);
    while(!Q.empty()){
        int x=Q.front();Q.pop();
        inq[x]=0;
        for(int i=0;i<G[x].size();i++){
            Edge e=E[G[x][i]];
            if(e.c==e.f||mina[x]+e.a>=mina[e.v]) continue;
            num[e.v]=G[x][i];
            mina[e.v]=mina[x]+e.a;
            if(!inq[e.v]){
                inq[e.v]=1;
                Q.push(e.v);
            }
        }
    }
    for(int i=T;i!=S;i=E[num[i]].u){
        int f=E[num[i]].c-E[num[i]].f;
        flow=f<flow?f:flow;
    }
    for(int i=T;i!=S;i=E[num[i]].u){
        E[num[i]].f+=flow;
        E[num[i]^1].f-=flow;
        ans+=E[num[i]].a*flow;
    }
    if(mina[T]==INF) return 0;
    return 1;
}

int main(){
    read();
    while(1){
        bool flag=SPFA();
        if(!flag) break;
    }
    printf("%d",ans);

    return 0;
}