hdu1151 最小路径覆盖

http://acm.hdu.edu.cn/showproblem.php?pid=1151

Problem Description

Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town‘s streets you can never reach the same intersection i.e. the town‘s streets
form no cycles.

With these assumptions your task is to write a program that finds the minimum number of paratroopers that can descend on the town and visit all the intersections of this town in such a way that more than one paratrooper visits no intersection. Each paratrooper
lands at an intersection and can visit other intersections following the town streets. There are no restrictions about the starting intersection for each paratrooper.

Input

Your program should read sets of data. The first line of the input file contains the number of the data sets. Each data set specifies the structure of a town and has the format:

no_of_intersections

no_of_streets

S1 E1

S2 E2

......

Sno_of_streets Eno_of_streets

The first line of each data set contains a positive integer no_of_intersections (greater than 0 and less or equal to 120), which is the number of intersections in the town. The second line contains a positive integer no_of_streets, which is the number of streets
in the town. The next no_of_streets lines, one for each street in the town, are randomly ordered and represent the town‘s streets. The line corresponding to street k (k <= no_of_streets) consists of two positive integers, separated by one blank: Sk (1 <= Sk
<= no_of_intersections) - the number of the intersection that is the start of the street, and Ek (1 <= Ek <= no_of_intersections) - the number of the intersection that is the end of the street. Intersections are represented by integers from 1 to no_of_intersections.

There are no blank lines between consecutive sets of data. Input data are correct.

Output

The result of the program is on standard output. For each input data set the program prints on a single line, starting from the beginning of the line, one integer: the minimum number of paratroopers required to visit all the intersections in the town.

Sample Input

2
4
3
3 4
1 3
2 3
3
3
1 3
1 2
2 3

Sample Output

2
1

/**
hdu 1151 最小路径覆盖
题目大意：在一个城镇，有m个路口，和n条路，这些路都是单向的，而且路不会形成环，现在要弄一些伞兵去巡查这个城镇，
         伞兵只能沿着路的方向走，问最少需要多少伞兵才能把所有的路口搜一遍。
解题思路：这个题目就转换成求解有向无环图的最小路径覆盖问题了。
          一个结论：有向无环图的最小路径覆盖=该图的顶点数-该图的最大匹配。
*/
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

const int N=200;
int n,m,g[N][N],linker[N],k;
bool used[N];

bool dfs(int u)
{
    for(int i=1;i<=n;i++)
    {
        if(g[u][i]&&used[i]==0)
        {
            used[i]=1;
            if(linker[i]==-1||dfs(linker[i]))
            {
                linker[i]=u;
                return true;
            }
        }
    }
    return false;
}

int hungary()
{
    memset(linker,-1,sizeof(linker));
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        memset(used,0,sizeof(used));
        if(dfs(i))
            ans++;
    }
    return ans;
}

int main()
{
   int T;
   scanf("%d",&T);
   while(T--)
   {
        scanf("%d%d",&n,&m);
        memset(g,0,sizeof(g));
        for(int i=0;i<m;i++)
        {
            int u,v,w;
            scanf("%d%d",&u,&v);
            g[u][v]=1;
        }
        int ans=hungary();
        printf("%d\n",n-ans);
   }
   return 0;
}