PAT A1094 The Largest Generation (25 分)(静态树求每层结点个数——DFS写法）

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

题意为求结点个数最多的层的level及其结点个数。利用DFS递归求解，用一个hash表存储每层结点个数，没深入一层，若有结点，对应的hash表中的结点数+1.直至求完后再在hash表中寻找最大的结点数，并将其所在层一起输出即可。

参考代码：

#include <cstdio>
#include <vector>
using namespace std;

const int maxn=110;
vector<int> child[maxn];//存放树的第i个结点的孩子结点 
int hashtable[maxn]={0};//存放第level层的结点个数 

void DFS(int index,int level) 
{
	hashtable[level]++;//第level层的结点个数+1.
	for(int i=0;i<child[index].size();++i)
		DFS(child[index][i],level+1);//遍历所有孩子结点，进行递归 
}

int n,m;
int main()
{
	int k;
	int father;
	scanf("%d%d",&n,&m);
	for(int i=0;i<m;++i)
	{
		scanf("%d",&father);//输入父节点 
		scanf("%d",&k);
		int id;//孩子结点 
		for(int j=0;j<k;++j)
		{
			scanf("%d",&id);
			child[father].push_back(id);//将孩子结点加入 
		}
	}
	DFS(1,1);
	int maxnum=-1,maxindex=-1;
	for(int i=1;i<=n;++i)
	{
		if(hashtable[i]>maxnum) //找到更多结点层 
		{
			maxnum=hashtable[i];//更新最多结点数 
			maxindex=i;//更新层数 
		}
	}
	printf("%d %d\n",maxnum,maxindex);
	return 0;
}