HDU 2255 奔小康赚大钱 km算法

村里要分房子，有N家老百姓，刚好有N间房子。考虑到每家都要有房住，每家必须分配到一间房子且仅仅能分配到一间房子。另外， 村长为了得到最大利益，让老百姓对房子进行估价

因为不同房子的价值是不同的，所以只考虑匹配数是不可以的，要用km算法或者网络流求最大匹配数值

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define rep(i, j, k) for(int i = j; i <= k; i++)
#define inf 0x7fffffff

using namespace std;

int n, val[310][310], link[310], lx[310], ly[310], slack[310], vis_x[310], vis_y[310];

bool dfs (int x)
{
//printf ("dfs  %d\n", x);
    vis_x[x] = 1;
    rep (i, 1, n)
        if (vis_y[i] == 0)
        {
            //vis_y[i] = 1;
            int tmp = lx[x] + ly[i] - val[x][i];
            if (tmp == 0)
            {
                vis_y[i] = 1;
                if (link[i] == -1 || dfs (link[i]))
                {
                    link[i] = x;
                    return 1;
                }
            }
            else
                slack[i] = min (slack[i], tmp);
        }
    return 0;
}

int solve ()
{
    memset (link, -1, sizeof (link));
    memset (ly, 0, sizeof (ly));
    rep (i, 1, n)
    {
        lx[i] = -inf;
        rep (j, 1, n)
            lx[i] = max (lx[i], val[i][j]);
    }
    rep (i, 1, n)
    {
        rep (j, 1, n)
            slack[j] = inf;
        while (1)
        {
            memset (vis_x, 0, sizeof (vis_x));
            memset (vis_y, 0, sizeof (vis_y));
            if (dfs (i))
                break;
            int d = inf;
            rep  (j, 1, n)
                if (vis_y[j] == 0)
                    d = min (d, slack[j]);
            rep (j, 1, n)
                if (vis_x[j])
                    lx[j] -= d;
            rep (j, 1, n)
                if (vis_y[j])
                    ly[j] += d;
                else
                    slack[j] -= d;
        }
    }
    int res = 0;
    rep (i, 1, n)
        if (link[i] != -1)
            res += val[link[i]][i];
    return res;
}

int main ()
{
    while (scanf ("%d", &n) == 1)
    {
        rep (i, 1, n)
            rep (j, 1, n)
                scanf ("%d", &val[i][j]);
        cout << solve () << endl;
    }
    return 0;
}