1.匈牙利算法模板:
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int N=505;
int line[N][N];
int girl[N],used[N];
int k,m,n;
bool found(int x)
{
for(int i=1; i<=n; i++)
{
if(line[x][i]&&!used[i])
{
used[i]=1;
if(girl[i]==0||found(girl[i]))
{
girl[i]=x;
return 1;
}
}
}
return 0;
}
int main()
{
int x,y;
while(scanf("%d",&k)&&k)
{
scanf("%d %d",&m,&n);
memset(line,0,sizeof(line));
memset(girl,0,sizeof(girl));
for(int i=0; i<k; i++)
{
scanf("%d %d",&x,&y);
line[x][y]=1;
}
int sum=0;
for(int i=1; i<=m; i++)
{
memset(used,0,sizeof(used));
if(found(i)) sum++;
}
printf("%d\n",sum);
}
return 0;
}
/*
x1 y1
x2 y2
x3 y3
x4 y4
x5
x6
m n
find(i) i是x点集的点
girl[i] 就是y点集中的点i在x点集匹配的点的标号,即girl[i]
line[i][j] i对应x点集,j对应y点集
used[i] 代表y点集的点i是否遍历过
*/
2.