1094 The Largest Generation (25分)【BFS解法】

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

 

题解：

本题用BFS解法。也可使用DFS 

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

struct node
{
	vector<int> child;
	int level;
}node[110];

int hashTable[110] = { 0 };
int n, m;

void BFS(int root) {
	queue<int> q;
	q.push(root);
	while (!q.empty())
	{
		int now = q.front();
		q.pop();
		hashTable[node[now].level]++;
		if (!node[now].child.empty())
			for (int i = 0; i < node[now].child.size(); i++)
			{
				int index = node[now].child[i];
				q.push(index);
				node[index].level = node[now].level + 1;
			}
	}
}

int main() {
	cin >> n >> m;
	int id, k, child;
	for (int i = 1; i <= m; i++)
	{
		cin >> id >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> child;
			node[id].child.push_back(child);
		}
	}

	node[1].level = 1;
	BFS(1);

	int max = -1, generation = 0;
	for (int i = 0; i < 110; i++)
		if (hashTable[i]>max)
		{
			max = hashTable[i];
			generation = i;
		}
	cout << max << ' ' << generation;
    return 0;
}