题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1179
#include <stdio.h>
#include <string.h>
#define MAXN 102
int map[MAXN][MAXN];
int from[MAXN],used[MAXN];
int match(int x,int m)//匈牙利算法
{
int i;
for(i=1;i<=m;++i)
{
if(!used[i]&&map[x][i])
{
used[i]=1;
if(from[i]==-1||match(from[i],m))
{
from[i]=x;
return 1;
}
}
}
return 0;
}
int main()
{
int n,m,i,j,k,sum;
while(scanf("%d %d",&n,&m)!=EOF)
{
sum=0;
memset(map,0,sizeof(map));
memset(from,-1,sizeof(from));
for(i=1;i<=m;++i)
{
scanf("%d",&k);
while(k--)
{
scanf("%d",&j);
map[i][j]=1;
}
}
for(i=1;i<=n;++i)
{
memset(used,0,sizeof(used));
if(match(i,m))
sum++;
}
printf("%d\n",sum);
}
return 0;
}