转载自:http://www.cnblogs.com/Dario67/archive/2011/04/19/2020599.html
http://poj.org/problem?id=1274
刚开始学二分最大匹配法(匈牙利算法),这个题目是一个很贴切的例题,原创很细心,在代码上做了很多解释,希望能帮助跟我一样还处于迷茫期的人。
The Perfect Stall
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 17888 | Accepted: 8141 |
Descriptio
n
Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data on which cows are willing to produce milk in which stalls. A stall may be only assigned to one cow, and, of course, a cow may be only assigned to one stall.
Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible.
Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible.
Input
The input includes several cases. For each case, the first line contains two integers, N (0 <= N <= 200) and M (0 <= M <= 200). N is the number of cows that Farmer John has and M is the number of stalls in the new barn. Each of the following N lines corresponds to a single cow. The first integer (Si) on the line is the number of stalls that the cow is willing to produce milk in (0 <= Si <= M). The subsequent Si integers on that line are the stalls in which that cow is willing to produce milk. The stall numbers will be integers in the range (1..M), and no stall will be listed twice for a given cow.
Output
For each case, output a single line with a single integer, the maximum number of milk-producing stall assignments that can be made.
Sample Input
5 5 2 2 5 3 2 3 4 2 1 5 3 1 2 5 1 2
Sample Output
4
AC代码:
//POJ1274
//匈牙利算法,二分图的最大匹配
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#define N 250
using namespace std;
int n, m, lin[N], count;//lin[i]:第i个stall相连的cow
bool map[N][N],used[N];
bool search(int a)
{//判断是否能构成新的增广序列的函数
for(int j=1;j<=m;j++)
if(map[a][j] && !used[j])
{//连通 没有用过
used[j] = 1;//标记
if(lin[j] == -1 || search(lin[j]))
{//无奶牛与之配对 或 构成增广序列
lin[j] = a;//记录该j产奶屋对应的奶牛序号a
return true;
}
}
return false;
}
int main(){
int i,j;
int si, temp;
while(scanf("%d %d",&n,&m) != EOF)
{
count = 0;
memset(map, false, sizeof(map));
memset(lin, -1, sizeof(lin));
for(i=1;i<=n;i++)
{
scanf("%d", &si);
for(j=1;j<=si;j++)
{
scanf("%d", &temp);
map[i][temp] = true;
}
}
//匈牙利算法
for (i=1;i<=n;i++)
{
memset(used, false, sizeof(used));//每次对循环中的used进行初始化
if(search(i))
count++;
}
printf("%d\n", count);
}
}