二分图最大匹配（匈牙利算法）

标准模板题，此算法可以通过dfs和bfs实现，下面以dfs实现：

先看基础知识：

简单例子实现算法模板 ：

 

 例题练习：

1.矩阵游戏

#include <iostream>
#include <string.h>

using namespace std;

int mapx[205][205];
bool v[205];
int c[205];
int n;

int dfs(int x)
{
	for (int i = 1; i <= n; i++)
	{
		if (!v[i] && mapx[x][i])
		{
			v[i] = 1;
			if (!c[i] || dfs(c[i]))
			{
				c[i] = x;
				return 1;
			}
		}
	}
	return 0;
}
int main()
{
	int t;

	cin >> t;

	while (t--)
	{
		cin >> n;

		memset(c, 0, sizeof (c));

		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				cin >> mapx[i][j];
			}
		}

		long long k = 0;
		for (int i = 1; i <= n; i++)
		{
			memset(v, 0, sizeof (v));
			if(dfs(i)) k++;
		}
		if (k == n) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}

2.有大家喜欢的零食吗

 

#include <iostream> 
#include <vector> 
#include <cstring> 
using namespace std; 
const int N = 5005;
 int n, k, a, ans; 
bool b[N]; 
int match[N]; 
vector<int> e[N]; 
bool dfs(int u) 
{ 
    for (int v : e[u]) 
    { 
        if (b[v]) 
        { 
            continue;
        } 
        b[v] = 1; 
        if (match[v] == 0 || dfs(match[v])) 
        { 
            match[v] = u; 
            return true; 
        } 
    } 
    return false; 
} 
int main() 
{ 
    cin >> n; 
    for (int i = 1; i <= n; i++) 
    { 
        cin >> k; 
        for (int j = 1; j <= k; j++) 
        { 
            cin >> a;
            e[i].push_back(a); 
        } 
    } 
    for (int i = 1; i <= n; i++) 
    { 
        memset(b, 0, sizeof(b)); 
        if (dfs(i))
        { 
            ans++; 
        } 
    } 
    if (ans == n) 
    { 
        cout << "Yes\n"; 
    } 
    else 
    { 
        cout << "No\n"; 
        cout << n - ans << "\n"; 
    } 
    return 0; 
}