http://poj.org/problem?id=2594
题意为DAG图中,给出n个点,m条单向边,可以在任意位置放置机器人,求出最小机器人数量去遍历所有点
即为求出最小路径覆盖
最小路径覆盖的路径不能有交点,需要先对该图求传递闭包。http://www.cnblogs.com/ka200812/archive/2011/07/31/2122641.html
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 500 + 5;
bool path[maxn][maxn];
int link[maxn], vis[maxn];
void flody(int n) {
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; ++i) {
if(path[i][k]) {
for(int j = 1; j <= n; ++j) if(path[k][j]) {
path[i][j] = true;
}
}
}
}
}
bool dfs(int u, int m) {
for(int v = 1; v <= m; ++v) {
if(!vis[v] && path[u][v]) {
vis[v] = 1;
if(link[v] == -1 || dfs(link[v], m)) {
link[v] = u;
return true;
}
}
}
return false;
}
int MaxMatch(int n, int m) {
int res = 0;
memset(link, -1, sizeof(link));
for(int i = 1; i <= n; ++i) {
memset(vis, 0, sizeof(vis));
if(dfs(i, m)) res++;
}
return res;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
while(cin >> n >> m) {
if(n == 0 && m == 0) return 0;
memset(path, false, sizeof(path));
int u, v;
for(int i = 0; i < m; ++i) {
cin >> u >> v;
path[u][v] = true;
}
flody(n);
cout << n - MaxMatch(n, n) << endl;
}
}