杭电1068二分图匹配

#include 
#include 

using namespace std;
const int N=502;
int map[N][N],n,match[N];
bool visited[N];
int find (int x){
	for (int i=0;i>n){
		int num,x,y;
		memset (map,0,sizeof (map));
		memset (match,-1,sizeof (match));
		for (int j=0;j>y;
				map[x][y]=1;
			}
		}
		int cnt=0;
		for (int i=0;i最大独立集 = V   -   最大匹配数
	}
	return 0;
}