PAT 1094. The Largest Generation

A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find the generation with the largest population.

Input Specification:

Each input file contains one test case. Each case starts with two positive integers N (<100) which is the total number of family members in the tree (and hence assume that all the members are numbered from 01 to N), and M (<N) which is the number of family members who have children. Then M lines follow, each contains the information of a family member in the following format:

ID K ID[1] ID[2] ... ID[K]

where ID is a two-digit number representing a family member, K (>0) is the number of his/her children, followed by a sequence of two-digit ID's of his/her children. For the sake of simplicity, let us fix the root ID to be 01. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the largest population number and the level of the corresponding generation. It is assumed that such a generation is unique, and the root level is defined to be 1.

Sample Input:

23 13
21 1 23
01 4 03 02 04 05
03 3 06 07 08
06 2 12 13
13 1 21
08 2 15 16
02 2 09 10
11 2 19 20
17 1 22
05 1 11
07 1 14
09 1 17
10 1 18

Sample Output:

9 4

思路：从根节点开始广度搜索，标记每个节点的所在层数，统计出节点最多的层
#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
using namespace std;
int N, M, K, cnt[110];
vector<int> child[110];
int main()
{
	while(scanf("%d %d", &N, &M) != EOF)
	{
		memset(cnt, 0, sizeof(cnt));
		int temp, tempchild, level = 1, length;
		for(int i = 0; i < M; i++)
		{
			scanf("%d %d", &temp ,&K);
			for(int i = 0; i < K; i++)
			{
				scanf("%d", &tempchild);
				child[temp].push_back(tempchild);
			}
		}
		queue<int> dp;
		dp.push(1);
		cnt[1] = 1;
		while(dp.size())
		{
			length = dp.size();
			level++;
			for(int j = 0; j < length; j++)
			{
				temp = dp.front();
				for(int i = 0; i < child[temp].size(); i++)
				{
					dp.push(child[temp][i]);
				}
				cnt[level] += child[temp].size();
				dp.pop();
			}
		}
		int maxIndex = 0;
		for(int i = 1; i < 110; i++)
		{
			maxIndex = cnt[maxIndex] < cnt[i] ? i : maxIndex;
		}
		printf("%d %d\n", cnt[maxIndex], maxIndex);
	}
	return 0;
}