题目链接:过山车
题目大意:有m个女生和n个男生,每个女生有一些喜欢的男生,问最多能匹配多少对情侣出去做过山车
题目思路:匈牙利算法算一个二分图最大匹配就好了
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 510;
int line[maxn][maxn],used[maxn],nxt[maxn];
int k,m,n,ans;
bool Find(int x){
for(int i = 1;i <= n;i++){
if(line[x][i]&&!used[i]){
used[i] = 1;
if(nxt[i] == 0||Find(nxt[i])){
nxt[i] = x;
return true;
}
}
}
return false;
}
int main(){
while(~scanf("%d",&k)){
if(k == 0) break;
scanf("%d%d",&m,&n);
memset(line,0,sizeof(line));
memset(nxt,0,sizeof(nxt));
while(k--){
int u,v;
scanf("%d%d",&u,&v);
line[u][v] = 1;
}
ans = 0;
for(int i = 1;i <= m;i++){
memset(used,0,sizeof(used));
if(Find(i)) ans++;
}
printf("%d\n",ans);
}
return 0;
}