PAT_A1094#The Largest Generation

Source:

PAT A1094 The Largest Generation (25 分)

Description:

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 (<) 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 (<) 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 (>) 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

Keys:

二叉树的建立和遍历

Code:

 /*

 time: 2019-08-24 15:25:08

 problem: PAT_A1094#The Largest Generation

 AC: 18:52

 题目大意：

 求树中结点个数最多的层次及其结点个数

 基本思路：

 遍历并统计各层次人数即可

 */

 #include<cstdio>

 #include<vector>

 using namespace std;

 const int M=1e3;

 vector<int> tree[M];

 int scale[M]={},largest=,generation;

 void Travel(int root, int layer)

 {

     scale[layer]++;

     if(scale[layer] > largest)

     {

         largest = scale[layer];

         generation = layer;

     }

     for(int i=; i<tree[root].size(); i++)

         Travel(tree[root][i],layer+);

 }

 int main()

 {

 #ifdef ONLINE_JUDGE

 #else

     freopen("Test.txt", "r", stdin);

 #endif // ONLINE_JUDGE

     int n,m,id,k,kid;

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

     for(int i=; i<m; i++)

     {

         scanf("%d%d", &id,&k);

         for(int j=; j<k; j++)

         {

             scanf("%d", &kid);

             tree[id].push_back(kid);

         }

     }

     Travel(,);

     printf("%d %d", largest,generation);

     return ;

 }

巴特西

PAT_A1094#The Largest Generation

Source:

Description:

Input Specification:

Output Specification:

Sample Input:

Sample Output:

Keys:

Code:

最新文章

热门文章