KM模板

KM模板：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <assert.h>        //assert宏
#include <sstream>
#include <queue>
#include <stack>
#include <set>
#include<algorithm>   //包含 sort()和 lower_bound()和 upper_bound()

#define PI 3.1415926535898
#define mem(x)  memset((x),0,sizeof((x)))
#define inf 0x7fffffff
#define MAXN 10+1000

#define M 12

#define fff 0.00000001
using namespace std;
int n,nx,ny;
int link[M];    //lx,ly为顶标，nx,ny分别为x点集y点集的个数

double lx[M];       //把原板子的 int 数据类型改成的 double
double ly[M];
double slack[M];
double p[12][1005];
double w[M][M];

int visx[M],visy[M];
int DFS(int x)
{
    visx[x] = 1;
    for (int y = 1;y <= ny;y ++)
    {
        if (visy[y])
            continue;
        double t = lx[x] + ly[y] - w[x][y];
        if (-fff <= t && t <= fff)       //
        {
            visy[y] = 1;
            if (link[y] == -1||DFS(link[y]))
            {
                link[y] = x;
                return 1;
            }
        }
        else if (slack[y] > t)  //不在相等子图中slack 取最小的
            slack[y] = t;
    }
    return 0;
}
double KM()
{
    int i,j;
    memset (link,-1,sizeof(link));
    memset (ly,0,sizeof(ly));
    for (i = 1;i <= nx;i ++)            //lx初始化为与它关联边中最大的
        for (j = 1,lx[i] = -inf;j <= ny;j ++)
            if (w[i][j] > lx[i])
                lx[i] = w[i][j];

    for (int x = 1;x <= nx;x ++)
    {
        for (i = 1;i <= ny;i ++)
            slack[i] = inf;
        while (1)
        {
            memset (visx,0,sizeof(visx));
            memset (visy,0,sizeof(visy));
            if (DFS(x))     //若成功（找到了增广轨），则该点增广完成，进入下一个点的增广
                break;  //若失败（没有找到增广轨），则需要改变一些点的标号，使得图中可行边的数量增加。
                        //方法为：将所有在增广轨中（就是在增广过程中遍历到）的X方点的标号全部减去一个常数d，
                        //所有在增广轨中的Y方点的标号全部加上一个常数d
            double d = inf;
            for (i = 1;i <= ny;i ++)
                if (!visy[i]  &&  d > slack[i])
                    d = slack[i];
            for (i = 1;i <= nx;i ++)
                if (visx[i])
                    lx[i] -= d;
            for (i = 1;i <= ny;i ++)  //修改顶标后，要把所有不在交错树中的Y顶点的slack值都减去d
                if (visy[i])
                    ly[i] += d;
                else
                    slack[i] -= d;
        }
    }
    double res = 0;
    for (i = 1;i <= ny;i ++)
        if (link[i] > -1)
            res += w[link[i]][i];
    return res;
}
int main ()     //比赛时把板子改成的这样(w[][]的数据类型是 double)
{
    int i,j;
    int T;
    int cas = 0;
    int n,m;
    cin>>T;
    while(T--){
        scanf("%d%d",&n,&m);
        mem(p);
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
            scanf("%lf",&p[i][j]);
        int num = 0;
        double ans = 0;
        while(num <= m){
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= n; j++)
                    w[i][j] = p[i-1][j-1+num];
            }
            num += n;
            nx = ny = n;
            ans += KM();
        }
        printf("Case #%d: %.5f\n",++cas,ans);
    }
    return 0;
}

int main()  //原板子 (w[][]的数据类型是 int)
{
    int i,j;
    while (scanf ("%d",&n)!=EOF)
    {
        nx = ny = n;
        for (i = 1;i <= n;i ++)
            for (j = 1;j <= n;j ++)
                scanf ("%d",&w[i][j]);
        int ans = KM();
        printf ("%d\n",ans);
    }
    return 0;
}