1094 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 IDto 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

 BFS 需要判断每一层的最后一个结点 用lastnode数组记录，表示每一层的最后一个结点。

代码如下：

---

#include<iostream>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
int n, m;
int tree[110];
queue<int> q;
int main() {
	cin >> n >> m;
	int tmp1, tmp2, tmp3;
	for (int i = 0; i < m; i++) {
		cin >> tmp1 >> tmp2;
		for (int j = 0; j < tmp2; j++) {
			cin >> tmp3;
			tree[tmp3] = tmp1;
		}
	}
	int lastnode[110], maxcnt = 1, maxl = 1;
	lastnode[1] = 1;
	q.push(1);
	int k = 1;
	while (!q.empty()) {
		int root = q.front();
		q.pop();
		for (int i = 2; i <= n; i++) {
			if (tree[i] == root) {
				q.push(i);
				lastnode[k + 1] = i;
			}
		}
		if (root == lastnode[k]) {
			if (q.size() > maxcnt) {
				maxcnt = q.size();
				maxl = k + 1;
				k++;
			}
		}
	}
	printf("%d %d", maxcnt, maxl);
	return 0;
}