Girls and Boys(二分匹配之最大独立集）

the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: there are no two students in the set who have been “romantically involved”. The result of the program is the number of students in such a set.

The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:

the number of students
the description of each student, in the following format
student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 …
or
student_identifier:(0)

The student_identifier is an integer number between 0 and n-1, for n subjects.
For each given data set, the program should write to standard output a line containing the result.
Input

7
0: (3) 4 5 6
1: (2) 4 6
2: (0)
3: (0)
4: (2) 0 1
5: (1) 0
6: (2) 0 1
3
0: (2) 1 2
1: (1) 0
2: (1) 0

Output

5
2

题意分析：

题上所给的数据例0: (3) 4 5 6，表示第一个学生与它有“浪漫参与”的有三个人，分别是4,5,6，现在求一个集合中没有“浪漫参与”的最大人数，即求最大独立集
解题思路：

最大独立集指的是两两之间没有边的顶点的集合，顶点最多的独立集成为最大独立集。定理为最大独立集=顶点的总数-最大匹配数，由于本题给出的只是学生之间有“浪漫参与”的学生，没有确定给出学生的性别，因此此时的最大匹配数除以2才是最终的最大匹配数。
代码：

#include<stdio.h>
#include<string.h>
int match[20000],e[2000][2000],book[20000];
int n,m;
int dfs(int u)
{
	int i;
	for(i=0;i<n;i++)
	{
		if(book[i]==0&&e[u][i]==1)
		{
			book[i]=1;
			if(match[i]==0||dfs(match[i]))
			{
				match[i]=u;
				return 1;
			}
		}
	}
	return 0;
}
int twq()
{
	int i,sum=0;
	memset(match,0,sizeof(match));
	for(i=0;i<n;i++)
	{
		memset(book,0,sizeof(book));
		if(dfs(i))
			sum++;
	}
	return sum;
}
int main()
{
	int i,a,b,c,sum1,j;
	while(scanf("%d",&n)!=EOF)
	{
		memset(e,0,sizeof(e));
		for(i=1;i<=n;i++)
		{
			scanf("%d: (%d)",&a,&b);
			for(j=1;j<=b;j++)
			{
				scanf("%d",&c);
				e[a][c]=1;
			}
		}
		sum1=twq();
		printf("%d\n",n-sum1/2);
	}
	return 0;
}