C - 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所用的最小时间。

• 解题思路  :

将横坐标看做二分图左边，将纵坐标看做二分图的右边，然后二分图匹配找出最大匹配数。

#include<stdio.h>
#include<string.h>

int map[110][110],book[110],girl[110];
int n,m;

int dfs(int u)
{
	int i;
	
	for(i = 1;i<=m;i ++)
	{
		if(book[i] == 0&&map[u][i] == 1)
		{
			book[i] = 1;
			if(girl[i] == 0||dfs(girl[i]))
			{
				girl[i] = u;
				
				return 1;
			}
		}
	}
	return 0;
}

int main()
{
	int i,j,sum;
	
	while(~ scanf("%d",&n))
	{
		if(n == 0)
		break;
		scanf("%d",&m);
		
		sum = 0;
		memset(map,0,sizeof(map));
		memset(girl,0,sizeof(girl));
		
		for(i = 1;i<=n;i ++)
		{
			for(j = 1;j<=m;j ++)
			{
				scanf("%d",&map[i][j]);
			}
		}
		
		for(i = 1;i<=n;i ++)
		{
			memset(book,0,sizeof(book));
				
			if(dfs(i))
			sum ++;
		}
		printf("%d\n",sum);
	}
	return 0;
}