HDU 1068 - 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

题意：

     给你每个人认识的人，求最多有多少人互相不认识。

思路：

     其实就是找最大独立集，最大独立集=顶点数 - 最大匹配数。

 

代码：

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