PAT advanced-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 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
题目要求：
统计每一层结点个数，输出结点个数最多的层次

思路：
简单题，只需要在结构体中增加一个layer变量记录结点所在层次，利用hash表记录每一层节点个数即可

#include<iostream>
#include<vector>
using namespace std;
int n, m, hashtable[105] = {0};  //哈希表，记录每一层结点个数
struct Node {
	int layer;
	vector<int> child;
}node[105];
int maxnum = 0, maxgen;   //记录结果
void DFStree(int root)
{
	int kidnum = node[root].child.size();   //当前节点孩子结点的个数
	int cur = node[root].layer;   //当前结点的层次
	hashtable[cur]++;
	if (hashtable[cur] > maxnum)   //更新结果
	{
		maxnum = hashtable[cur];
		maxgen = cur;
	}
	if (kidnum == 0) return;

	for (int i = 0; i < kidnum; i++)
	{
		int kid = node[root].child[i];
		node[kid].layer = node[root].layer + 1;
		DFStree(kid);
	}
}
int main()
{
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int root, k;
		cin >> root >> k;
		node[root].child.resize(k);
		for (int j = 0; j < k; j++)
			cin >> node[root].child[j];
	}
	node[1].layer = 1;
	DFStree(1);
	cout << maxnum <<" "<< maxgen << endl;
}