二分图 最佳匹配 KM算法模板 -- HDU 2255 奔小康赚大钱

HDU 2255 奔小康赚大钱

题意：
n个村民重新分配n间房子，接下来n行表示，第i个村民对第j个房子出的价格，问怎样才能使村里的机构获得最大收入。

思路：
KM算法模板。

KM算法详解：

https://www.cnblogs.com/fzl194/p/8848061.html

https://www.cnblogs.com/fzl194/p/8834847.html

code：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn = 3e2 + 5;
const int inf = 1 << 29;
int mp[maxn][maxn], slack[maxn];
int wx[maxn], wy[maxn];
int match[maxn];   
int cntx, cnty;
bool visx[maxn], visy[maxn];


bool dfs(int u){
	visx[u] = true;
	for(int i = 1; i <= cnty; i++){
		int v = i;
		if(visy[v]) continue;
		int t = wx[u] + wy[v] - mp[u][v];
		if(t == 0) {
			visy[v] = true;
			if(match[v] == -1 || dfs(match[v])) {
				 match[v] = u;
				 return true;
			}
		}
		else if(t > 0) {
			slack[v] = min(slack[v], t);
		}
	}
	return false;
}


int KM() {
	for(int i = 1; i <= cntx; i++) wx[i] = 0;
	for(int i = 1; i <= cnty; i++) match[i] = -1, wy[i] = 0;
	
	for(int i = 1; i <= cntx; i++)
	   for(int j = 1; j <= cnty; j++) 
	      wx[i] = max(wx[i], mp[i][j]);
	     
	     
	for(int i = 1; i <= cntx; i++) {
		for(int j = 1; j <= cnty; j++) slack[j] = inf;
		
		while(1) {
			for(int j = 1; j <= cntx; j++) visx[j] = false;
			for(int j = 1; j <= cnty; j++) visy[j] = false;
			
			if(dfs(i)) break;
			                 
			int minz = inf;
			for(int j = 1; j <= cnty; j++) 
			   if(!visy[j]) minz = min(minz, slack[j]); 
			for(int j = 1; j <= cntx; j++) 
			   if(visx[j]) wx[j] -= minz;
			for(int j = 1; j <= cnty; j++) 
			   if(visy[j]) wy[j] += minz;
			   else slack[j] -= minz;
		}
				 
	}
	
	int ans = 0;
	for(int i = 1; i <= cnty; i++) {
		ans += mp[match[i]][i];
	}
	return ans;
} 

int main() {
	int n;
	while(~scanf("%d", &n)) {
	
	    for(int i = 1; i <= n; i++)
	        for(int j = 1; j <= n; j++)
	            scanf("%d", &mp[i][j]);
	      
	    cntx = cnty = n;
	
	    printf("%d\n", KM());
	    
	}      
	      
}