模板对应POJ 3041
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
/*******************匈牙利算法求最大匹配*****************/
const int N = 510;
int uN, vN;//uN, vN为左右独立点集的数量
int g[N][N];
int linker[N];
bool used[N];
bool dfs(int u){//从左边开始找增广路径
for(int v = 1;v <= vN;v++)
if(g[u][v]&&!used[v]){
used[v] = true;
if(linker[v] == -1||dfs(linker[v])){//找增广路,反向
linker[v] = u;
return true;
}
}
return false;
}
int MaxMatch(){
int res = 0;
memset(linker, -1, sizeof(linker));
for(int u = 1;u <= uN;u++){
memset(used, 0, sizeof(used));
if(dfs(u)) res++;
}
return res;
}
/***************************END************************/
int main(){
int n, m, i, a, b;
while(~scanf("%d%d", &n, &m)){
vN = uN = n;
memset(g, 0, sizeof(g));
for(i = 0;i < m;i++){
scanf("%d%d", &a, &b);
g[a][b] = 1;
}
cout << MaxMatch() << endl;
}
return 0;
}