POJ_3692_kindergarten_最大团

In a kindergarten, there are a lot of kids. All girls of the kids know each other and all
 boys also know each other. In addition to that, some girls and boys know each other. Now the
 teachers want to pick some kids to play a game, which need that all players know each other.
 You are to help to find maximum number of kids the teacher can pick.

Input

The input consists of multiple test cases. Each test case starts with a line containing three integers
G, B (1 ≤ G, B ≤ 200) and M (0 ≤ M ≤ G × B), which is the number of girls, the number of boys and
the number of pairs of girl and boy who know each other, respectively.
Each of the following M lines contains two integers X and Y (1 ≤ X≤ G,1 ≤ Y ≤ B), which indicates that
 girl X and boy Y know each other.
The girls are numbered from 1 to G and the boys are numbered from 1 to B.

The last test case is followed by a line containing three zeros.

Output

For each test case, print a line containing the test case number( beginning with 1) followed by a
integer which is the maximum number of kids the teacher can pick.

题意：已知班级有g个女孩和b个男孩，所有女生之间都相互认识，所有男生之间也相互认识，
给出m对关系表示哪个女孩与哪个男孩认识。现在要选择一些学生来组成一个团，使得里面所有人都认识，
求此团最大人数。


1.独立集：任意两点都不相连的顶点的集合

2.定理：最大独立集=顶点数-最大匹配边数（二分图当然也成立）

3.完全子图：任意两点都相连的顶点的集合（最大完全子图即最大团）  

4.定理：最大团=原图补图的最大独立集

Sample Input

2 3 3
1 1
1 2
2 3
2 3 5
1 1
1 2
2 1
2 2
2 3
0 0 0

Sample Output

Case 1: 3

Case 2: 4

#include <stdio.h>
#include <string.h>
int used[205];
int match[205];
int s[205][205];
int g,b,m;
void init()
{
	memset(match,0,sizeof(match));
	memset(s,0,sizeof(s));
}
int dfs(int x)
{
	int y;
	for(y=1;y<=b;y++)
	{
		if(!used[y] && !s[x][y])//补图
		{
			used[y] = 1;
			if(!match[y] || dfs(match[y]))
			{
				match[y] = x;
				return 1;
			}
		}
	}
	return 0;
}
int main()
{	
	int num = 1;
	while(scanf("%d%d%d",&g,&b,&m)&&(g+b+m))
	{
		int i,j,x,y;
		init();
		for(i=1;i<=m;i++)
		{
			scanf("%d%d",&x,&y);
			{
				s[x][y] = 1;
			}
		}
		int res = 0;
		for(i=1;i<=g;i++)
		{
			memset(used,0,sizeof(used));
			if(dfs(i))
			{
				res++;
			}
		}
		printf("Case %d: %d\n",num++,b+g-res);
	}
	return 0;
}