Matrix（二分匹配最小点覆盖数）

Give you a matrix(only contains 0 or 1),every time you can select a row or a column and delete all the ‘1’ in this row or this column .

Your task is to give out the minimum times of deleting all the ‘1’ in the matrix.
Input
There are several test cases.

The first line contains two integers n,m(1<=n,m<=100), n is the number of rows of the given matrix and m is the number of columns of the given matrix.
The next n lines describe the matrix:each line contains m integer, which may be either ‘1’ or ‘0’.

n=0 indicate the end of input.
Output
For each of the test cases, in the order given in the input, print one line containing the minimum times of deleting all the ‘1’ in the matrix.
Sample Input

3 3 
0 0 0
1 0 1
0 1 0
0

Sample Output

2

题意分析：给你一个二维的矩阵，可以选择一行或者一列去删除1，问你将所有的1删除后，最少用的次数是多少。
解题思路：将二维矩阵的第i行，第j列看成是第i个女孩与第j个男孩是否能匹配成功1表示能匹配成功，0表示不能匹配成功，这样问题就转化为了求最大的匹配数的问题上来了。
最小点覆盖数=最大匹配数。

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
int match[20000],book[20000],n,m,e[2000][2000];
int dfs(int u)
{
	int i;
	for(i=1;i<=m;i++)
	{
		if(book[i]==0&&e[u][i]==1)
		{
			book[i]=1;
			if(match[i]==0||dfs(match[i]))
			{
				match[i]=u;
				return 1;
			}
		}
	}
	return 0;
}
int main()
{
	int i,j,sum;
	while(scanf("%d",&n),n!=0)
	{
		memset(match,0,sizeof(match));
		//memset(e,0,sizeof(e));
		cin>>m;
		sum=0;
		for(i=1;i<=n;i++)
			for(j=1;j<=m;j++)
				scanf("%d",&e[i][j]);
		for(i=1;i<=n;i++)
		{
			memset(book,0,sizeof(book));
			if(dfs(i))
				sum++;
		}
		printf("%d\n",sum);
	}
	return 0;
}