【二分图入门专题1】C - Machine Schedule hdu1150 【最小顶点覆盖】

As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that must be satisfied and the type of schedule desired. Here we consider a 2-machine scheduling problem. 

There are two machines A and B. Machine A has n kinds of working modes, which is called mode_0, mode_1, …, mode_n-1, likewise machine B has m kinds of working modes, mode_0, mode_1, … , mode_m-1. At the beginning they are both work at mode_0.

For k jobs given, each of them can be processed in either one of the two machines in particular mode. For example, job 0 can either be processed in machine A at mode_3 or in machine B at mode_4, job 1 can either be processed in machine A at mode_2 or in machine B at mode_4, and so on. Thus, for job i, the constraint can be represent as a triple (i, x, y), which means it can be processed either in machine A at mode_x, or in machine B at mode_y. 

Obviously, to accomplish all the jobs, we need to change the machine‘s working mode from time to time, but unfortunately, the machine‘s working mode can only be changed by restarting it manually. By changing the sequence of the jobs and assigning each job to a suitable machine, please write a program to minimize the times of restarting machines. 

5 5 10
0 1 1
1 1 2
2 1 3
3 1 4
4 2 1
5 2 2
6 2 3
7 2 4
8 3 3
9 4 3
0

3
题意：输入三个数,n,m,k,再输入k行数，每行输入三个数i,x,y。问，使x,y连通的最小顶点覆盖
思路：用一次最大匹配的模板就好啦。
一大早wwrong两发来迎接我真是醉了,还有这道题哪里说了下标从1开始的？？？我找了半天没找到相应的语句

#include<stdio.h>
#include<string.h>
#define N 110
int n,m,k;
int book[N],e[N][N],match[N];

int dfs(int u)
{
    int i;
    for(i = 1; i <= m; i ++)
    {
        if(!book[i]&&e[u][i])
        {
            book[i] = 1;
            if(!match[i]||dfs(match[i]))
            {//printf("i=%d u=%d \n",i,u);
                match[i] = u;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    int i,j,t1,t2,t3,sum;
    while(scanf("%d",&n),n!=0)
    {
        memset(e,0,sizeof(e));
        memset(match,0,sizeof(match));
        scanf("%d%d",&m,&k);
        for(i = 0; i < k; i ++)
        {
            scanf("%d%d%d",&t1,&t2,&t3);
            e[t2][t3] = 1;
        }
        sum = 0;
        for(i = 1; i <= n; i ++)
        {
            memset(book,0,sizeof(book));
            if(dfs(i))
            {
                sum ++;//printf("sum=%d\n",sum);
            }
                
        }
        printf("%d\n",sum);
    }
    return 0;
}