这道题目和上一题差不多,就是求的不同,这题求最大匹配!
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
const int maxn=205;
int mp[maxn][maxn];
int mark[maxn];
int pipei[maxn];
int n,m;
bool find(int x)
{
for(int i=1; i<=n; i++)
{
if(!mark[i]&&mp[x][i])
{
mark[i]=1;
if(pipei[i]==-1||find(pipei[i]))
{
pipei[i]=x;
return true;
}
}
}
return false;
}
int main()
{
int i,j;
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(mp,0,sizeof(mp));
memset(pipei,-1,sizeof(pipei));
for(i=1; i<=n; i++)
{
int a,b;
scanf("%d",&a);
for(j=1; j<=a; j++)
{
scanf("%d",&b);
mp[i][b]=1;
}
}
int sum=0;
for(i=1; i<=m; i++)
{
memset(mark,0,sizeof(mark));
if(find(i))
sum++;
}
printf("%d\n",sum);
}
return 0;
}