PAT 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.

输入描述:

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.

输出描述:

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.

输入例子:

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

输出例子:

9 4

题目解读

本题给出一颗树所有节点的子节点个数及其编号（从01~99），要求计算树的哪层节点数目最多，并输出该层的节点个数和层号（假设根所处层为1）。

题目解答

利用DFS。

• 定义变量index和level，分别代表当前dfs所处的节点序号和节点所在层号。
• 定义vector数组，记录每个父节点对应的子节点号
• 定义book数组，记录当前层已搜索到的节点个数

C++核心代码如下：

const int maxn = 100; // 树的节点个数从01~99
vector<int> v[maxn]; // 记录每个父节点对应的子节点号
int book[maxn]; // 记录当前层已搜索到的节点个数

void dfs(int level, int index){ // level为层号，index为节点序号
	book[level]++; // 先更新当前层节点个数
	for (int i = 0; i < v[index].size(); i++){ // 子节点个数
		dfs(level + 1, v[index][i]); // 遍历父节点的所有子节点
	}
}

C++ 代码如下：

#include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;

const int maxn = 100; // 树的节点个数从01~99
vector<int> v[maxn]; // 记录每个父节点对应的子节点号
int book[maxn]; // 记录当前层已搜索到的节点个数

void dfs(int level, int index){ // level为层号，index为节点序号
	book[level]++; // 先更新当前层节点个数
	for (int i = 0; i < v[index].size(); i++){ // 子节点个数
		dfs(level + 1, v[index][i]); // 遍历父节点的所有子节点
	}
}

int main()
{
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i++){
		int id, k, tmp;
		cin >> id >> k;
		for (int j = 0; j < k; j++){
			cin >> tmp; v[id].push_back(tmp);
		}
	}
	dfs(1, 1);
	int ans_level, ans_num;
	ans_num = 0;
	for (int i = 1; i < maxn; i++){
		if (ans_num < book[i]){
			ans_num = book[i];
			ans_level = i;
		}
	}
	cout << ans_num << " " << ans_level << endl;
	return 0;
}