【PAT甲级A1094】The Largest Generation (25分)（c++）

1094 The Largest Generation (25分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：200 ms
内存限制：64 MB

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

题意：

给出族谱，构建树，选出人数最多的一层，输出这层的人数，和这层的序列号，老祖宗为第一层。

思路：

构建邻接表，采用dfs深度优先遍历是记录层数，每次进入dfs就该层数结点+1；

参考代码：

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<vector<int>> v;
vector<int> levelnum(101);
int n, m, id, k;

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

int main() {
    scanf("%d%d", &n, &m);
    v.resize(n + 1);
    for (int i = 0; i < m; i++) {
        scanf("%d%d", &id, &k);
        v[id].resize(k);
        for (int j = 0; j < k; j++)scanf("%d", &v[id][j]);
    }
    dfs(1, 1);
    int index = max_element(levelnum.begin(), levelnum.end()) - levelnum.begin();
    printf("%d %d", levelnum[index], index);
    return 0;
}

如有错误，欢迎指正