PAT A1094 The Largest Generation (25分)

原题

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

大体题意

输出拥有结点数最多的层数的结点数和层数，假设根是第1层

思路

层序遍历
level[i]记录结点i所在的层数
book[j]记录第j层的结点数
最后求得book数组里的最大值即可，对应的j就是最大的层数

代码

#include <iostream>
using namespace std;
#include <vector>
#define maxn 110
#include <queue>
vector<int> tree[maxn];
int n, m;
int level[maxn], book[maxn];
//level[i]记录结点i所在的层数
//book[j]记录层数j所拥有的结点数
void bfs()
{
	queue<int>q;
	q.push(1);
	level[1] = 1;
	while (!q.empty())
	{
		int index = q.front();
		q.pop();
		book[level[index]]++;
		for (int i = 0; i < tree[index].size(); i++)
		{
			level[tree[index][i]] = level[index] + 1;
			q.push(tree[index][i]);
		}
	}
	int maxnum = 0, maxlevel = 1;
	for (int i = 1; i < 100; i++)
	{
		if (book[i] > maxnum)
		{
			maxnum = book[i];
			maxlevel = i;
		}
	}
	printf("%d %d\n", maxnum, maxlevel);
}

int main()
{
	cin >> n >> m;
	int id, k, x;
	for (int i = 0; i < m; i++)
	{
		cin >> id >> k;
		while (k--)
		{
			cin >> x;
			tree[id].push_back(x);
		}
	}
	bfs();
	return 0;
}

运行结果