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

题意：输入n和m，分别代表树中所有结点的数量和所有非叶子结点的数量，然后再输入每个非叶子结点和它的孩子的数目和它的孩子的编号，输出这棵树中拥有结点数最多的一层的结点的数目和这一层的层号，根节点位于第一层
思路：用一个vector[110]来存储这些结点的孩子结点编号，然后写dfs函数，参数分别为index和level,两个都从1开始，设置一个book[110]数组表示该层有多少个结点，然后对每个结点遍历进行调用dfs函数。

#include<iostream>
#include<cstdio>
#include<stack> 
#include<queue>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<cctype>
#include<cstdlib>
#include<ctime>
#include<unordered_map>

using namespace std;

vector<int> v[110];
int book[110];

void dfs(int index,int level) {
	book[level]++;
	for(int i = 0;i < v[index].size();i++) {
		dfs(v[index][i],level + 1);		
	}
}

int main() {
	int n,m,k,a,c;
	scanf("%d%d",&n,&m);
	for(int i = 0;i < m;i++) {
		scanf("%d%d",&a,&k);
		for(int j = 0;j < k;j++) {
			scanf("%d",&c);
			v[a].push_back(c);
		}
	}
	dfs(1,1);
	int maxnum = 1,maxlevel = 1;
	for(int i = 1;i <= n;i++) {
		if(book[i] > maxnum) {
			maxnum = book[i];
			maxlevel = i;
		}
	}
	printf("%d %d\n",maxnum,maxlevel);
	return 0;
}