A1094 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（结点编号为 1 ~ N）、非叶子结点个数 M

接下来M行输入每个非叶子结点的孩子结点

第二行：21号结点有1个孩子结点为23

思路：

定义全局 hashTable 数组，记录每一层的结点数

使用DFS函数，用来记录当前访问的结点 index ，以及该点的 level，进入函数时，先 HashTable 加1，之后递归遍历index 的孩子节点

定义数的静态写法 vector<int> Node[MAXN]

误区：不用单独记录每一个节点的层次再来统计，每一次DFS之前直接在HashTable中增加节点个数即可

#include <cstdio>
#include <vector>
using namespace std;
const int MAXN = 110;
vector<int> Node[MAXN];         //数的静态写法，Node[i] 存放结点i的孩子结点编号
int hashTable[MAXN] = {0};      //记录每层的结点个数
void DFS(int index, int level){
    hashTable[level]++;
    for(int j = 0; j < Node[index].size(); j++){
        DFS(Node[index][j], level + 1);
    }
}
int main(){
    int n, m, parent, k, child;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < m; i++){
        scanf("%d%d", &parent, &k);
        for(int j = 0; j < k; j++){
            scanf("%d", &child);
            Node[parent].push_back(child);
        }
    }
    DFS(1, 1);
    int maxLevel = -1, maxValue = 0;
    for(int i = 1; i < MAXN; i++){
        if(hashTable[i] > maxValue){
            maxValue = hashTable[i];
            maxLevel = i;
        }
    }
    printf("%d %d\n", maxValue, maxLevel);
    return 0;
}