PAT甲级 -- 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

我的思路：

1. 结构体数字记录每个结点的孩子结点，进行递归，每访问一个结点，对当前深度结点个数加1，并记录最大的深度

2. 在深度数组中找最大者，输出即可

#include <iostream>
#include <vector>
using namespace std;
struct node
{
	vector<int> child;
}a[100];
int num[100] = {0};
int n, m, maxDepth = 1;
void dfs(int root, int depth){
	if(maxDepth < depth){
		maxDepth = depth;
	}	
	num[depth]++;
	if(a[root].child.size() == 0) return;
	for(int i = 0; i < a[root].child.size(); i++){
		dfs(a[root].child[i], depth+1);
	}
}
int main(){
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++){
		int id, k;
		scanf("%d %d", &id, &k);
		a[id].child.resize(k);
		for(int j = 0; j < k; j++){
			scanf("%d", &a[id].child[j]);
		}
	}
	dfs(1,1);
	int index = 1;
	for(int i = 1; i <= maxDepth; i++){
		if(num[index] < num[i]){
			index = i;
		}
	}
	printf("%d %d", num[index], index);
	return 0;
}