题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2255
题意:中文题
解析:最大权完美匹配裸题,直接上km板子
#include <bits/stdc++.h>
using namespace std;
const int maxn = 305;
const int inf = 0x3f3f3f3f;
int g[maxn][maxn];
int lx[maxn],ly[maxn];
int visx[maxn],visy[maxn];
int match[maxn],slack[maxn];
int n;
bool dfs(int u)
{
visx[u] = 1;
for(int i=0;i<n;i++)
{
if(visy[i]) continue;
int deta = lx[u]+ly[i] - g[u][i];
if(!deta)
{
visy[i] = 1;
if(match[i]==-1 || dfs(match[i]))
{
match[i] = u;
return true;
}
}
else
slack[i] = min(slack[i],deta);
}
return false;
}
int km()
{
memset(match,-1,sizeof(match));
memset(ly,0,sizeof(ly));
for(int i=0;i<n;i++)
{
lx[i] = g[i][0];
for(int j=0;j<n;j++)
lx[i] = max(lx[i],g[i][j]);
}
for(int i=0;i<n;i++)
{
fill(slack,slack+n,inf);
for(;;)
{
memset(visx,0,sizeof(visx));
memset(visy,0,sizeof(visy));
if(dfs(i))
break;
int d = inf;
for(int j=0;j<n;j++)
{
if(!visy[j])
d = min(d,slack[j]);
}
for(int j=0;j<n;j++)
{
if(visx[j])
lx[j] -= d;
if(visy[j])
ly[j] += d;
else
slack[j] -= d;
}
}
}
int res = 0;
for(int i=0;i<n;i++)
res += g[match[i]][i];
return res;
}
int main(void)
{
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
scanf("%d",&g[i][j]);
}
printf("%d\n",km());
}
return 0;
}