hdu2119

最大匹配水题

AC代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<cmath>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define LL long long
const int MOD=100000007;
const int inf=0x3f3f3f3f;
const LL inff=0x3f3f3f3f3f3f3f3f;
const LL MAX_N=10005;
const LL MAX_M=50005;
#define MEF(x) memset(x,-1,sizeof(x))
#define ME0(x) memset(x,0,sizeof(x))
#define MEI(x) memset(x,inf,sizeof(x)
int mapt[105][105];
int vis[105];
int nu[105];
int n,m;
int f(int x)
{
    for(int m1=1;m1<=m;m1++)
    {
        if(!vis[m1]&&mapt[x][m1])
        {
            vis[m1]=1;
            if(nu[m1]==-1||f(nu[m1]))
            {
                nu[m1]=x;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    while(cin>>n&&n)
    {
        cin>>m;
        for(int n1=1;n1<=n;n1++)
        {
            for(int m1=1;m1<=m;m1++)
            {
                cin>>mapt[n1][m1];
            }
        }
        MEF(nu);
        int ans=0;
        for(int n1=1;n1<=n;n1++)
        {
            ME0(vis);
            ans+=f(n1);
        }
        cout<<ans<<endl;
    }
    return 0;
}