poj3041

模板题

/*POJ30412016年7月25日11:02:09*/#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <cstring>#include <cstdio>#include <string>#include <algorithm>#include <cmath>#define F(i,a,b) for(int i=a;i<=b;i++)#define f(i,a,b) for(int i=a;i<b;i++)#define mem(a,b); memset(a,b,sizeof(a));#define put(a);  cout<<a<<endl;#define intab bool cmp(int a, int b){ return a>b; }using namespace std;const int maxn = 500 + 10;int K, M, N;bool map[maxn][maxn], vis[maxn];int link[maxn];int ta, tb;int cnt;bool dfs(int x){F(i, 1, M)if (map[x][i] && !vis[i]){vis[i] = 1;if (!link[i] || dfs(link[i])){link[i] = x; return true;}}return false;}int main(){while (cin >> M){scanf("%d", &K);mem(map, 0);mem(link, 0);cnt = 0;F(i, 1, K)scanf("%d%d", &ta, &tb), map[ta][tb] = 1;F(i, 1, M){mem(vis, 0);if (dfs(i))++cnt;}put(cnt);}return 0;}/*3 41 11 32 23 22*/