[模板]二分图最大权匹配

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
using namespace std;
const int INF=1e9;
const int maxn=410;
const int maxm=160010;
queue<int>q;
int visx[maxn],visy[maxn],linkx[maxn],linky[maxn],slack[maxn];
int w[maxn][maxn],lx[maxn],ly[maxn],pre[maxn];
int n,m,nl,nr;
void read(int &x){
    x=0;
    char c=getchar();
    while(c<'0' || c>'9') c=getchar();
    while(c>='0' && c<='9'){
        x=x*10+c-'0';
        c=getchar();
    }
}
void change(int v){
    while(v) linky[v]=pre[v],swap(linkx[pre[v]],v);
}
void update(){
    int a=INF;
    for(int i=1;i<=n;i++)if(!visy[i])a=min(a,slack[i]);
    for(int i=1;i<=n;i++){
        if(visx[i]) lx[i]-=a;
        if(visy[i]) ly[i]+=a;else slack[i]-=a;
    }
}
void bfs(int x){
    while(!q.empty()) q.pop();
    q.push(x);
    visx[x]=1;
    while(1){
        while(!q.empty()){
            int u=q.front();q.pop();
            for(int i=1;i<=n;i++)if(!visy[i]){
                if(lx[u]+ly[i]==w[u][i]){
                    pre[i]=u;visy[i]=1;
                    if(!linky[i]){change(i);return; }
                    else{visx[linky[i]]=1,q.push(linky[i]);}
                }else if(slack[i]>lx[u]+ly[i]-w[u][i]) pre[i]=u,slack[i]=lx[u]+ly[i]-w[u][i];
            }
        }
        update();
        for(int i=1;i<=n;i++)if(!visy[i] && !slack[i]){
            if(!linky[i]){ change(i);return; }
            else visy[i]=visx[linky[i]]=1,q.push(linky[i]);
        }
    }
}
void km(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++) slack[j]=INF;
        memset(visx,0,sizeof(visx));memset(visy,0,sizeof(visy));
        bfs(i);
    }
}
int main(){
    read(nl);read(nr);read(m);
    n=max(nl,nr);
    for(int i=1;i<=m;i++){
        int u,v;
        read(u);read(v);read(w[u][v]);
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++) lx[i]=max(lx[i],w[i][j]);
    km();
    long long ans=0;
    for(int i=1;i<=n;i++) ans+=lx[i]+ly[i];
    printf("%lld\n",ans);
    for(int i=1;i<=nl;i++) if(w[i][linkx[i]])printf("%d ",linkx[i]);else printf("0 ");
    return 0;
}

^_^