前言
KM算法用于求二分图完全匹配时的最大总权值。
本文不讲算法具体过程,主要是方便大家刷题巩固。它的原理是基于匈牙利算法基础上,通过修改标杆(也就是链接文中的好感度)实现最大化。如果是求最小总权值只需要将两点间的权值取负,最后答案取负即可。
模板:
#include <bits/stdc++.h>
using namespace std;
const int maxn=3e2+10;
const int INF = 0x3f3f3f3f;
#define faster ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
int link[maxn][maxn],usex[maxn],usey[maxn],ptn[maxn],exx[maxn],exy[maxn],sl[maxn];
int n;
bool find(int x){
usex[x]=1;
for (int i = 1; i <= n; ++i) {
if (!usey[i]){
int t=exx[x]+exy[i]-link[x][i];
if (t==0) {
usey[i]=1;
if (!ptn[i] || find(ptn[i])) {
ptn[i] = x;
return true;
}
} else {
sl[i]= min(sl[i],t);
}
}
}
return false;
}
int KM(){
for (int i = 1; i <= n; ++i) {
exx[i]=link[i][1];
for (int j = 2; j <= n; ++j) {
exx[i]=max(link[i][j],exx[i]);
}
}
for (int i = 1; i <= n; ++i) {
fill(sl+1,sl+n+1,INF);
while (1){
memset(usex,0,sizeof usex);
memset(usey,0,sizeof usey);
if (find(i)) break;
int d=INF;
for (int j = 1; j <= n; ++j) {
if (!usey[j]) d= min(d,sl[j]);
}
for (int j = 1; j <= n; ++j) {
if (usex[j]) exx[j]-=d;
if (usey[j]) exy[j]+=d;
else sl[j] -= d;
}
}
}
int res=0;
for (int i = 1; i <= n; ++i) {
res+=link[ptn[i]][i];
}
return res;
}
signed main(){
faster;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
cin >> link[i][j];
}
}
cout << KM() << endl;
return 0;
}