hdu 2063 二分图匹配入门题 匈牙利算法

点击链接题目

二分图模板题

#include<stdio.h>#include<string.h>int G[501][501];int vis[501],link[501];int k,m,n;void clear(){memset(G,0,sizeof(G));memset(link,0,sizeof(link));}int dfs(int u){for(int i=1;i<=n;i++){if(G[u][i]&&!vis[i]){vis[i]=1;if(!link[i]||dfs(link[i])){link[i]=u;return 1;}}}return 0;}int main(){while(~scanf("%d",&k)&&k){int i,u,v,ans=0;scanf("%d%d",&m,&n);clear();for(i=0;i<k;i++){scanf("%d%d",&u,&v);G[u][v]=1;}for(i=1;i<=m;i++){memset(vis,0,sizeof(vis));ans+=dfs(i);}printf("%d\n",ans);}}