PAT-A1094 The Largest Generation 题目内容及题解

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. 读入家谱树；
2. 用深度优先遍历数出每层的人数；
3. 找到最大值并按照题目要求输出；
4. 返回零值。

代码

#include<cstdio>
#include<vector>
using namespace std;
#define maxn 110

int N,M;

vector<int> node[maxn];
vector<int> d[maxn];

void Init(){
    int i,j,k;
    int id,a;
    scanf("%d%d",&N,&M);
    for(i=0;i<M;i++){
        scanf("%d%d",&id,&k);
        for(j=0;j<k;j++){
            scanf("%d",&a);
            node[id].push_back(a);
        }
    }
}

void DFS(int id,int depth){
    int i;
    d[depth].push_back(id);
    for(i=0;i<node[id].size();i++){
        DFS(node[id][i],depth+1);
    }
    return;
}

int main(){
    int i,temp,u=-1,Max=-1;
    Init();
    DFS(1,1);
    for(i=1;i<maxn;i++){
        temp=d[i].size();
        if(temp>Max){
            u=i;
            Max=temp;
        }
    }
    printf("%d %d\n",Max,u);
    return 0;
}

运行结果