KM匹配的模板题。。。。
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 305
#define maxm 400005
#define eps 1e-10
#define mod 1000000007
#define INF 99999999
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head
int linker[maxn];
int slack[maxn];
int g[305][305];
bool visx[maxn];
bool visy[maxn];
int lx[maxn];
int ly[maxn];
int n, nx, ny;
bool dfs(int x)
{
visx[x] = true;
for(int y = 0; y < ny; y++) {
if(visy[y]) continue;
int tmp = lx[x] + ly[y] - g[x][y];
if(!tmp) {
visy[y] = true;
if(linker[y] == -1 || dfs(linker[y])) {
linker[y] = x;
return true;
}
}
else slack[y] = min(slack[y], tmp);
}
return false;
}
void km()
{
memset(linker, -1, sizeof linker);
memset(ly, 0, sizeof ly);
for(int i = 0; i < nx; i++) {
lx[i] = -INF;
for(int j = 0; j < ny; j++)
lx[i] = min(lx[i], g[i][j]);
}
for(int x = 0; x < nx; x++) {
for(int i = 0; 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 = 0; i < ny; i++)
if(!visy[i] && d > slack[i])
d = slack[i];
for(int i = 0; i < nx; i++)
if(visx[i]) lx[i] -= d;
for(int i = 0; i < ny; i++)
if(visy[i]) ly[i] += d;
else slack[i] -= d;
}
}
}
void read()
{
nx = ny = n;
for(int i = 0; i < nx; i++)
for(int j = 0; j < ny; j++)
scanf("%d", &g[i][j]);
}
void work()
{
km();
int res = 0;
for(int i = 0; i < ny; i++) res += g[linker[i]][i];
printf("%d\n", res);
}
int main()
{
while(scanf("%d", &n)!=EOF) {
read();
work();
}
return 0;
}