HDU - 2255（二分图最大权匹配）

题意：每个村民只能买一间房子，而且买的每间房子出价不同要求最大出价

题解：二分图最大权匹配即可

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int mx = 1e3+5;
const int inf = 0x3f3f3f3f;
int lx[mx],ly[mx];
int vx[mx],vy[mx];
int y[mx],w[mx][mx];
int n;
bool find(int u){
    vx[u] = 1;
    for(int i = 1; i <= n; i++)
        if(!vy[i]&&lx[u]+ly[i]==w[u][i]){
            vy[i] = 1;
            if(!y[i]||find(y[i])){
                y[i] = u;
                return true;
            }
        }
    return false;
}
int KM(){
    memset(y,0,sizeof(y));
    for(int i = 1; i <= n; i++){
        lx[i] = -inf;
        ly[i] = 0;
        for(int j = 1; j <= n; j++)
            lx[i] = max(lx[i],w[i][j]);
    }
    for(int u = 1; u <= n; u++){
        while(1){
            memset(vx,0,sizeof(vx));
            memset(vy,0,sizeof(vy));
            if(find(u)) break;
            int inc = inf;
            for(int i = 1; i <= n; i++)
                if(vx[i])
                for(int j = 1; j <= n; j++)
                   if(!vy[j])
                        inc = min(lx[i]+ly[j]-w[i][j],inc);
            for(int i = 1; i <= n; i++){
                if(vx[i]) lx[i]-=inc;
                if(vy[i]) ly[i]+=inc;
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++)
        ans += w[y[i]][i];
    return ans;
}
int main(){
    while(scanf("%d",&n)!=EOF){
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                scanf("%d",&w[i][j]);
        printf("%d\n",KM());
    }
    return 0;
}