匈牙利算法模板 hdu 1150 Machine Schedule（二分匹配）

二分图：https://blog.csdn.net/c20180630/article/details/70175814

https://blog.csdn.net/flynn_curry/article/details/52966283

匈牙利算法模板：https://blog.csdn.net/sunny_hun/article/details/80627351

例题：hdu 1150 Machine Schedule

参考：https://www.cnblogs.com/qq-star/p/4675600.html

https://www.cnblogs.com/kuangbin/archive/2012/08/19/2646928.html

注意：要用scanf输入输出！

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 using namespace std;
 const int N=;
 int line[N][N],used[N],girl[N];
 int n,m;//n相当于左点书，m右点数
 bool find(int x)//模板
 {
     int j;
     for (j=;j<m;j++)
     {
         if (line[x][j]==true && used[j]==false)
         {
             used[j]=;
             if (girl[j]== || find(girl[j]))
             {
                 girl[j]=x;
                 return true;
             }
         }
     }
     return false;
 }
 int main()
 {
     int k;
     while (cin>>n)
     {
         if (!n)
         {
             break;
         }
         cin>>m>>k;
         memset(line,,sizeof(line));
         memset(girl,,sizeof(girl));
         while (k--)
         {
             int ind,a,b;
             cin>>ind>>a>>b;
             line[a][b]=;
         }
         int ans=;
         for (int i=;i<n;i++)//因为初始状态为0，所以不用考虑0状态
         {
             memset(used,,sizeof(used));
             if (find(i))
             {
                 ans++;
             }
         }
         cout<<ans<<endl;
     }

     return ;
 }