HDU1151有向图的最小路径覆盖

顶点数-最大匹配数

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

int mp[222][222];
int match[222];
bool vis[222];

int n,m;

bool dfs(int x){
    for(int i = 1 ; i <= n ; i ++){
        if(mp[x][i] == 1 && vis[i] == 0){
            vis[i] = 1;
            if(match[i] == -1 || dfs(match[i])){
                match[i] = x;
                return true;
            }
        }
    }
    return false;
}

void init(){
    memset(match,-1,sizeof(match));
    memset(mp,-1,sizeof(mp));
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&m);
        init();
        for(int i = 0 ; i < m ; i ++){
            int a,b;
            scanf("%d%d",&a,&b);
            mp[a][b] = 1;
        }
        int ans = n;
        for(int i = 1 ; i <= n ; i ++){
            memset(vis,0,sizeof(vis));
            if(dfs(i))
                ans--;
        }
        printf("%d\n",ans);
    }
    return 0;
}