PAT - 甲级 - 1094. The Largest Generation (25)(树的遍历DFS)

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.n个节点
2.m个有孩子的节点，并且给出相应关系

要求：
1.该树的哪层的兄弟节点最多，是多少

求解：
1.建树过程中求根节点，即没有祖先的节点
2.从根节点开始遍历该树，并且更新每一层的兄弟节点数量
3.在结果中找出兄弟节点数量最多的层输出

---

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

int n, m, k, p, son, id, maxsum, root;
int depth[105];
bool roots[105];

vector<int> parents[105];

void dfs(int v, int d){
	depth[d]++;
	if(parents[v].size() == 0){
		return ;
	}
	for(int i = 0; i < parents[v].size(); i++){
		dfs(parents[v][i], d+1);
	}
}

int main(){
	freopen("input.txt", "r", stdin);
	fill(roots, roots+105, true);
	fill(depth, depth+105, 0);
	maxsum = -1;

	scanf("%d%d",&n,&m);

	for(int i = 0; i < m; i++){
		scanf("%d%d",&p, &k);
		for(int j = 0; j < k; j++){
			scanf("%d",&son);
			roots[son] = false;
			parents[p].push_back(son);
		}
	}

	for(int i = 1; i <= n; i++){
		if(roots[i]){
			root = i;
			break;
		}
	}
	dfs(root, 1);

	for(int i = 1; i < 105; i++){
		if(maxsum < depth[i]){
			id = i;
			maxsum = depth[i];
		}
	}
	printf("%d %d\n",maxsum, id);

	return 0;
}