二分图匹配---匈牙利算法学习

这篇博文写的非常好

 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1010;
int Map[maxn][maxn];
int use[maxn];
int girl[maxn];
int n,m;

void input(){
	int u,v;
	memset(Map, 0, sizeof(Map));
	for(int i = 1; i <= m; i++){
		cin >> u >> v;
		Map[u][v] = 1;
	}
}

bool Find(int k){
	for(int i = 1; i <= n; i++){
		if(Map[k][i] && !use[i]){
			use[i] = 1;
			if(!girl[i] || Find(girl[i])){
				girl[i] = k;
				return true;
			}
		}
	}
	return false;
}

int match(){
	int sum = 0;
	for(int i = 1; i <= n; i++){
		memset(use, 0, sizeof(use));
		if(Find(i))sum++;
	}
	return sum;
}

int main(){
	int t;
	while(cin >> n >> m){
		input();
		memset(girl, 0, sizeof(girl));
		cout << match() << endl;
	}
    return 0;
}