Treasure Exploration 【传递闭包】+【最小路径覆盖】

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
DAG图中求最小路径覆盖就是==顶点数–最大匹配数目。
注意 这个其中的题意是 ，可以走重复的点。所以就要先用弗罗里达求一次传递闭包，然后再求一次最小路径覆盖

代码

#include<stdio.h>
#include<string.h>
#define LL long long
using namespace std;
const int MAXN = 500+10;
const int MAXM =5000+100;
const int inf = 0x3f3f3f3f;
inline int read(){
    int f=1,x=0;char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') {x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
/*------------------------------*/
int mp[MAXN][MAXN];
int n,m;
void init(){
    for(int i=0;i<=n;i++)
        for(int j=0;j<=n;j++)
        mp[i][j]=0;
}
void getmap(){
    while(m--){
        int a,b;
        scanf("%d%d",&a,&b);
        mp[a][b]=1;
    }
}
void wall(){
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                mp[i][j]=mp[i][j]||(mp[i][k]&&mp[k][j]);
            }
        }
    }
}
int used[MAXN];
int pipei[MAXN];
int Find(int x){
    for(int i=1;i<=n;i++){
        if(!used[i]&&mp[x][i]){
            used[i]=1;
            if(!pipei[i]||Find(pipei[i])){
                pipei[i]=x;
                return 1;
            }
        }
    }
    return 0;
}
int main(){
   while(scanf("%d%d",&n,&m)&&(n||m)){
    init();
    getmap();
    wall();
    int cnt=0;
    memset(pipei,0,sizeof(pipei));
    for(int i=1;i<=n;i++){
        memset(used,0,sizeof(used));
        if(Find(i)) cnt++;
    }
    printf("%d\n",n-cnt);
   }
    return 0;
}