【HDOJ】1150 Machine Schedule

匈牙利算法。

 #include <stdio.h>
 #include <string.h>

 #define MAXNUM 1005

 char map[MAXNUM][MAXNUM];
 char visit[MAXNUM];
 int son[MAXNUM];

 int find(int x, int m) {
     int i;

     for (i=; i<m; ++i) {
         if (!visit[i] && map[x][i]) {
             visit[i] = ;
             if (!son[i] || find(son[i], m)) {
                 son[i] = x;
                 return ;
             }
         }
     }

     return ;
 }

 int main() {
     int n, m, k;
     int i, j;

     while (scanf("%d", &n)!=EOF && n) {
         scanf("%d %d", &m, &k);
         memset(map, , sizeof(map));
         while (k--) {
             scanf("%*d %d %d", &i, &j);
             if (i && j)
                 map[i][j] = ;
         }
         k = ;
         memset(son, , sizeof(son));
         for (i=; i<n; ++i) {
             memset(visit, , sizeof(visit));
             if (find(i, m))
                 ++k;
         }
         printf("%d\n", k);
     }

     return ;
 }