AIR raid(有向无环图的最小路径覆盖)

题目大意：求有向无环图的最小路径覆盖的模板题。

题解：有如下公式：最小路径覆盖=点数-最大匹配数 

 

#include<bits/stdc++.h>
using namespace std;
const int maxn = 505;
int edge[maxn][maxn], vis[maxn], link[maxn];
int m, n;
int find(int x)
{
	for (int i = 1; i <=m; i++)
	{
		if (edge[x][i] == 1 && vis[i] == 0)
		{
			vis[i] = 1;
			if (link[i] == -1 || find(link[i])) {
				link[i] = x;
				return 1;
			}
			
		}
	}
	return 0;
}
int hungary()
{
	memset(link, -1, sizeof(link));
	int ans = 0;
	for (int i = 1; i <=m; i++)
	{
		memset(vis, 0, sizeof(vis));
		if (find(i))ans++;
	}
	return ans;
}
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		memset(edge, 0, sizeof(edge));
		cin >> m >> n;
		int x, y;
		for (int i = 1; i <= n; i++)
		{
			cin >> x >> y;
			edge[x][y] = 1;
		}
		cout << m - hungary()<<endl;
	}
}