奔小康赚大钱 HDU - 2255 （KM匹配）

题目 https://cn.vjudge.net/problem/HDU-2255

题意

裸地km匹配

思路

#include <bits/stdc++.h>

using namespace std;
const int INF = 0x3f3f3f3f;
int mp[330][330];
int slack[330];
int lx[330],ly[330];
int vx[330],vy[330];
int n;
int match[330];
int nx,ny;
int DFS(int x)
{
    vx[x] = 1;
    for(int y = 1;y <= ny;y++)
    {
        if(vy[y])
            continue;
        int tmp = lx[x] + ly[y] - mp[x][y];
        if(tmp == 0)
        {
            vy[y] = 1;
            if(match[y] == -1||DFS(match[y]))
            {
                match[y] = x;
                return 1;
            }
        }
        else if(slack[y] > tmp)
            slack[y] = tmp;
    }
    return 0;
}

int km_perfect_match()
{
    memset(ly,0,sizeof(ly));
    memset(lx,0,sizeof(lx));
    for(int i = 1;i <= nx;i++) //初始化点标
    {
        for(int j = 1;j <= ny;j++)
        {
            lx[i] = max(lx[i],mp[i][j]);
        }
    }
    for(int x = 1;x <= nx;x++)
    {
        for(int i = 1;i <= ny;i++)
        {
            slack[i] = INF;
        }
        while(1)
        {
            memset(vx,0,sizeof(vx));
            memset(vy,0,sizeof(vy));
            if(DFS(x))
                break;
            int d = INF;
            for(int i = 1;i <= ny;i++)
            {
                if(!vy[i]&&d>slack[i])
                    d = slack[i];
            }
            for(int i = 1;i <= nx;i++)
                if(vx[i])
                lx[i] -= d;
            for(int i = 1;i <= ny;i++)
            {
                if(vy[i])
                    ly[i] += d;
                else
                    slack[i] -= d;
            }
        }
    }
}

int main()
{
    while(scanf("%d", &n) != EOF){
    int ans = 0;
    nx = ny = n;
    memset(match,-1,sizeof(match));
    for(int i = 1;i <= n;i++)
    for(int j = 1;j <= n;j++)
    {
        scanf("%d",&mp[i][j]);
    }
    km_perfect_match();
    for(int i = 1;i <= ny;i++)
        ans += mp[match[i]][i];
    printf("%d\n",ans);
    }
    return 0;
}