最大匹配水题
AC代码:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<cmath>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define LL long long
const int MOD=100000007;
const int inf=0x3f3f3f3f;
const LL inff=0x3f3f3f3f3f3f3f3f;
const LL MAX_N=10005;
const LL MAX_M=50005;
#define MEF(x) memset(x,-1,sizeof(x))
#define ME0(x) memset(x,0,sizeof(x))
#define MEI(x) memset(x,inf,sizeof(x))
int mapt[505][505];
int vis[505];
int nu[505];
int n,m,k,a,b;
int f(int x)
{
for(int n1=1;n1<=n;n1++)
{
if(!vis[n1]&&mapt[x][n1])
{
vis[n1]=1;
if(nu[n1]==-1||f(nu[n1]))
{
nu[n1]=x;
return 1;
}
}
}
return 0;
}
int main()
{
while(cin>>k&&k)
{
cin>>m>>n;
ME0(mapt);
for(int k1=1;k1<=k;k1++)
{
cin>>a>>b;
mapt[a][b]=1;
}
MEF(nu);
int ans=0;
for(int m1=1;m1<=m;m1++)
{
ME0(vis);
ans+=f(m1);
}
cout<<ans<<endl;
}
return 0;
}