hdu1150 Machine Schedule (二分图的最小顶点覆盖)

#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=0;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 k,n,m,sum,i,j,x,y;
while(scanf("%d",&n)&&n)
{
memset(map,0,sizeof(map));
memset(from,-1,sizeof(from));
sum=0;
scanf("%d %d",&m,&k);
for(i=0;i<k;++i)
{
scanf("%d %d %d",&j,&x,&y);
if(x&&y)//初始状态机器处于mode_0状态
map[x][y]=1;
}
for(i=0;i<n;++i)
{
memset(used,0,sizeof(used));
if(match(i,m))
++sum;
}
printf("%d\n",sum);
}
return 0;
}