https://www.luogu.org/problem/show?pid=3386
匈牙利算法不断寻找增广路;
尽可能让当前枚举的i可以匹配;
时间复杂度自己看代码;
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define Ll long long
using namespace std;
struct cs{int to,nxt;}a[1000008];
int head[1005],ll;
int link[1005];
bool vi[1005];
int n,m,e,x,y,ans;
bool dfs(int x){
for(int k=head[x];k;k=a[k].nxt)
if(!vi[a[k].to]){
vi[a[k].to]=1;
if(!link[a[k].to]||dfs(link[a[k].to])){
link[a[k].to]=x;return 1;
}
}return 0;
}
int main()
{
scanf("%d%d%d",&n,&m,&e);
for(int i=1;i<=e;i++){
scanf("%d%d",&x,&y);
if(x>m||y>m)continue;
a[++ll].to=y;
a[ll].nxt=head[x];
head[x]=ll;
}
for(int i=1;i<=n;i++){
memset(vi,0,sizeof vi);
if(dfs(i))ans++;
}printf("%d",ans);
}