最小费用最大流模板

struct MCMF{
    int n,m;
    vector<Edge> edges;
    vector<int> G[maxn];
    int a[maxn];
    int p[maxn];
    int d[maxn];
    int inq[maxn];

    void init(int n){
        this->n=n;
        for(int i=0;i<n;++i) G[i].clear();
        edges.clear();
    }

    void AddEdge(int from,int to,int cap,int cost){
        edges.push_back(Edge(from,to,cap,0,cost));
        edges.push_back(Edge(to,from,0,0,-cost));
        m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    bool BellmanFord(int s,int t,int &flow,long long &cost){
        for(int i=0;i<n;++i) d[i]=Inf;
        memset(inq,0,sizeof(inq));
        d[s]=0; inq[s]=1; a[s]=Inf; p[s]=0;
        queue<int> Q;
        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=edges[G[x][i]];
                if(d[e.to]>d[x]+e.cost && e.cap>e.flow){
                    d[e.to]=d[x]+e.cost;
                    a[e.to]=min(a[x],e.cap-e.flow);
                    p[e.to]=G[x][i];
                    if(!inq[e.to]){
                        inq[e.to]=1;
                        Q.push(e.to);
                    }
                }
            }
        }
        if(d[t]==Inf) return false;
        flow+=a[t];
        cost+=(long long)a[t]*d[t];
        for(int u=t;u!=s;u=edges[p[u]].from){
            edges[p[u]].flow+=a[t];
            edges[p[u]^1].flow-=a[t];
        }
        return true;
    }

    int MincostMaxflow(int s,int t,long long &cost){
        int flow=0;
        cost=0;
        while(BellmanFord(s,t,flow,cost));
        return flow;
    }
};