hdu 2119 Matrix 行列匹配

裸的行列匹配，但是通过这题更清楚了二分图的构造，即X, Y两部分，且两部分各自没有边相连。而一般连边的时候，是从X部连向Y部，即

for ( int i = 1; i <= n; i++ )
{
	for ( int j = 1; j <= m; j++ )
	{
		if(a[i][j])
		{
			v[i].push_back(j);
			//v[j].push_back(i);
		}
	}
}

反正注释掉的部分是不用连回来的- -。

#include<stdio.h>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iostream>

#define N 105

using namespace std;

int a[N][N];
int link[N];
int vis[N];
vector <int> v[N];
int n, m;

int dfs( int u )
{
	for( int i = 0; i < v[u].size(); i++ )
	{
		int to = v[u][i];
		if( !vis[to] )
		{
			vis[to] = 1;
			if( link[to] == -1 || dfs( link[to] ) )
			{
				link[to] = u;
				return 1;
			}
		}
	}
	return 0;
}

int main()
{
	while(~scanf("%d", &n) && n)
	{
		scanf("%d", &m);
		for( int i = 1; i <= n; i++ )
		{
			v[i].clear();
		}
		int cnt = 0;
		for( int i = 1; i <= n; i++ )
		{
			for( int j = 1; j <= m; j++ )
			{
				scanf("%d", &a[i][j]);
			}
		}
		for ( int i = 1; i <= n; i++ )
		{
			for ( int j = 1; j <= m; j++ )
			{
				if(a[i][j])
				{
					v[i].push_back(j);
					//v[j].push_back(i);
				}
			}
		}
		memset(link, -1, sizeof(link));
		int ans = 0;
		for( int i = 1; i <= n; i++)
		{
			memset(vis, 0, sizeof(vis));
			ans += dfs(i);
		}
		printf("%d\n", ans);
	}
	return 0;
}