poj 2594-flody + 最小路径覆盖

首先明确：最短路径数 = 节点数 - 最大匹配

题目意思：

给你一个有向无环图，有n个点，m条有向边。

一个机器人可以从任意点开始沿着边的方向走下去。对于每一个机器人：走过的点不能再走过。

问你最少用几个机器人可以走完所有的n个点，不同的机器人可以走相同的点。

这个题目是可以重点的，就是一个点可以有多路径覆盖，

解释什么叫可以重点，上图中要是可以重点，那么只要2个机器人不走回头路就可以走完所有路，否则，要3个

对于原图中的任意两个点u和v，如果从u到v存在有向路径，就连边(u, v)。这可以用Floyd实现。然后对这个图用经典最小路径覆盖就行了。

Description

Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would never know what fun treasure exploring brings to you. 
Recently, a company named EUC (Exploring the Unknown Company) plan to explore an unknown place on Mars, which is considered full of treasure. For fast development of technology and bad environment for human beings, EUC sends some robots to explore the treasure. 
To make it easy, we use a graph, which is formed by N points (these N points are numbered from 1 to N), to represent the places to be explored. And some points are connected by one-way road, which means that, through the road, a robot can only move from one end to the other end, but cannot move back. For some unknown reasons, there is no circle in this graph. The robots can be sent to any point from Earth by rockets. After landing, the robot can visit some points through the roads, and it can choose some points, which are on its roads, to explore. You should notice that the roads of two different robots may contain some same point. 
For financial reason, EUC wants to use minimal number of robots to explore all the points on Mars. 
As an ICPCer, who has excellent programming skill, can your help EUC?

Input

The input will consist of several test cases. For each test case, two integers N (1 <= N <= 500) and M (0 <= M <= 5000) are given in the first line, indicating the number of points and the number of one-way roads in the graph respectively. Each of the following M lines contains two different integers A and B, indicating there is a one-way from A to B (0 < A, B <= N). The input is terminated by a single line with two zeros.

Output

For each test of the input, print a line containing the least robots needed.

Sample Input

1 0
2 1
1 2
2 0
0 0

Sample Output

1
1
2

代码：

#include <stdio.h>
#include <string.h>
#define MX 510
int n, m;
bool g[MX][MX], v[MX];
int match[MX];

void floyd() {
	for(int k = 1; k <= n; ++k)
		for(int i = 1; i <= n; ++i)
			for(int j = 1; j <= n; ++j) {
				if(g[i][k] && g[k][j]) g[i][j] = 1;
			}
}

bool find(int x) {
	for(int i = 1; i <= n; ++i) {
		if(!v[i] && g[x][i]) {
			v[i] = 1;
			if(match[i] == -1 || find(match[i])) {
				match[i] = x;
				return 1;
			}
		}
	}
	return 0;
}

void hungary() {
	int ans = 0;
	for(int i = 1; i <= n; ++i) {
		memset(v, 0, sizeof(v));
		if(find(i)) ans ++;
	}
	printf("%d\n", n - ans);
}
int main() {	
	while(~scanf("%d%d", &n, &m) && (n || m)) {
		memset(g, 0, sizeof(g));
		memset(match, -1, sizeof(match));
		int a, b;
		for(int i = 1; i <= m; ++i) {
			scanf("%d%d", &a, &b);
			g[a][b] = 1;
		}
		floyd();
		hungary(); 
	} 
	return 0;
}