POJ 3041 Asteroids 匈牙利算法

#include<cstdio>
#include<cstring>
using namespace std;
bool used[510];
int n,m,ans,girl[510],a[510][510];
int find(int x){
	int i,j;
	for(j=1;j<=n;j++)
		if(a[x][j]&&used[j]==0){ 
			used[j]=1;
			if(girl[j]==0||find(girl[j])){
				girl[j]=x;
				return 1;
			}
		}
	return 0;
}
int main(){
	int i,x,y;
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++){
		scanf("%d%d",&x,&y);
		a[x][y]=1;
	}
	for(i=1;i<=n;i++){
		memset(used,0,sizeof(used));
		ans+=find(i);
	}
	printf("%d\n",ans);
	return 0;
}