poj1274 匈牙利算法

匈牙利算法参考http://wenku.baidu.com/view/0789f0ebe009581b6bd9ebd5.html

http://wenku.baidu.com/view/524d5b858762caaedd33d4cc.html  

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<limits.h>
#define MAX 220
using namespace std;
bool map[MAX][MAX];
int match[MAX];
bool visit[MAX];
int m,n;
bool find(int k)
{
int i,j;
for(i=1;i<=m;i++)
{
if(visit[i]==false&&map[k][i])
{
visit[i]=true;
if(match[i]==0||find(match[i]))
{
match[i]=k;
return true;
}
}
}
return false;
}
int hungary()
{
int sum=0;
int i;
for(i=1;i<=n;i++)
{
memset(visit,0,sizeof(visit));
if(find(i))
sum++;
}
return sum;
}
int main()
{
int i,j,k;
while(scanf("%d%d%",&n,&m)!=EOF)
{
memset(map,0,sizeof(map));
memset(match,0,sizeof(match));
for(i=1;i<=n;i++)
{
scanf("%d",&j);
while(j--)
{
scanf("%d",&k);
map[i][k]=true;
}
}
printf("%d\n",hungary());
}
}