（最小权二分匹配）Tour

http://acm.hdu.edu.cn/showproblem.php?pid=3488

题意为求出权值最小的包括所有点的环
用KM求出最小权匹配即是答案
如图，12即是一个环，345又是一个环

#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 400 + 5;
int n, nx, ny;
int linker[maxn], lx[maxn], ly[maxn], slack[maxn];
int visx[maxn], visy[maxn], w[maxn][maxn];

int dfs(int x) {
    visx[x] = 1;
    for(int y = 1; y <= ny; ++y) {
        if(visy[y]) continue;
        int tmp = lx[x] + ly[y] - w[x][y];
        if(tmp == 0) {
            visy[y] = 1;
            if(linker[y] == -1 || dfs(linker[y])) {
                linker[y] = x;
                return 1;
            }
        }
        else if(slack[y] > tmp) slack[y] = tmp;
    }
    return 0;
}
int KM() {
    memset(linker, -1, sizeof(linker));
    memset(ly, 0, sizeof(ly));
    for(int i = 1; i <= nx; ++i) {
        lx[i] = -INF;
        for(int j = 1; j <= ny; ++j)
            if(w[i][j] > lx[i]) lx[i] = w[i][j];
    }
    for(int x = 1; x <= nx; ++x) {
        for(int i = 1; i <= ny; ++i)
            slack[i] = INF;
        while(true) {
            memset(visx, 0, sizeof(visx));
            memset(visy, 0, sizeof(visy));
            if(dfs(x)) break;
            int d = INF;
            for(int i = 1; i <= ny; ++i)
                if(!visy[i] && d > slack[i])
                    d = slack[i];
            for(int i = 1; i <= nx; ++i)
                if(visx[i]) lx[i] -= d;
            for(int i = 1; i <= ny; ++i)
                if(visy[i]) ly[i] += d;
                else slack[i] -= d;
        }
    }
    int res = 0;
    for(int i = 1; i <= ny; ++i)
        if(linker[i] != -1)
            res += w[linker[i]][i];
    return res;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;
    while(T--) {
        int m;
        cin >> n >> m;
        nx = ny = n;
        memset(w, 0x80, sizeof(w));
        int u, v, ww;
        for(int i = 0; i < m; ++i) {
            cin >> u >> v >> ww;
            w[u][v] = max(w[u][v], -ww);
        }
        int ans = KM();
        cout << -ans << endl;
    }
}