UVA11383 Golden Tiger Claw

题目大意：给定一个N*N矩阵，每个格子(i,j)有正权值w(i,j)，要求你为每一行r、每一列c确定一个数l(r)、l(c)，要求对任一格子(i,j)有l(r) + l(c) >= w(i, j),要求所有l之和尽量小

题解：KM裸题，不学KM可能会死很惨

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define abs(a) ((a) < 0 ? (-1 * (a)) : (a))
template<class T>
inline void swap(T &a, T &b)
{
T tmp = a;a = b;b = tmp;
}
inline void read(int &x)
{
x = 0;char ch = getchar(), c = ch;
while(ch < '0' || ch > '9') c = ch, ch = getchar();
while(ch <= '9' && ch >= '0') x = x * 10 + ch - '0', ch = getchar();
if(c == '-') x = -x;
}
const int INF = 0x3f3f3f3f;
const int MAXN = 500 + 10;
int g[MAXN][MAXN], n1, n2, lab1[MAXN], lab2[MAXN], lk1[MAXN], lk2[MAXN], pre[MAXN], vis[MAXN], sla[MAXN];
void cal(int x)
{
memset(vis, 0, sizeof(vis)), memset(pre, 0, sizeof(pre)), memset(sla, 0x3f, sizeof(sla)), vis[0] = 1;
int y;
do
{
y = 0;
for(int i = 1;i <= n2;++ i)
{
if(vis[i]) continue;
if(lab1[x] + lab2[i] - g[x][i] < sla[i]) sla[i] = lab1[x] + lab2[i] - g[x][i], pre[i] = x;
if(sla[i] < sla[y]) y = i;
}
int d = sla[y];
for(int i = 1;i <= n1;++ i) if(vis[lk1[i]]) lab1[i] -= d;
for(int i = 1;i <= n2;++ i) if(vis[i]) lab2[i] += d; else sla[i] -= d;
vis[y] = 1;
}while(x = lk2[y]);
for(;y;swap(y, lk1[lk2[y] = pre[y]]));
}
int KM()
{
for(int i = 1;i <= n1;++ i) cal(i); int ans = 0;
for(int i = 1;i <= n1;++ i) ans += g[i][lk1[i]]; return ans;
}
int main()
{
while(scanf("%d", &n1) != EOF)
{
n2 = n1;memset(g, 0, sizeof(g)), memset(lab1, 0, sizeof(lab1)), memset(lab2, 0, sizeof(lab2)), memset(lk1, 0, sizeof(lk1)), memset(lk2, 0, sizeof(lk2));
for(int i = 1;i <= n1;++ i)
for(int j = 1;j <= n2;++ j)
read(g[i][j]), lab1[i] = max(lab1[i], g[i][j]);
int ans = KM();
for(int i = 1;i < n1;++ i) printf("%d ", lab1[i]); printf("%d\n", lab1[n1]);
for(int i = 1;i < n2;++ i) printf("%d ", lab2[i]); printf("%d\n", lab2[n2]);
printf("%d\n", ans);
}
return 0;
}

UVA11383