# PAT The Largest Generation (25)

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.

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.

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.

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

9 4

这道题目不多说了，求最多人数的那一代是哪一代，并且求其人数是多少。

bfs（）遍历，遍历的过程中把儿子是哪一代的标记好，然后找出最大值就可以了

感觉计算是哪一代的时候还可以改进一下，不用算那么多步的，但是不想在写个for循环了，不过我觉得改了之后速度应该会更快一点吧。

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
//用来保存单个有孩子的人的孩子们和孩子们的数量以及属于哪一代，用generation表示
struct  familyl
{
int  numOfChild,generation;
vector<int> child;
//构造函数
familyl(){}
familyl(int _numOfChild, int _generation, vector<int> _child) : numOfChild(_numOfChild), generation(_generation), child(_child){}

};
//maxNumOfGeneration为最后的最大人口的那一代的人口的数量,layer为第几代
int m, n,maxNumOfGeneration=0,layer=0;
//que用于bfs
queue<int> que;
//家族谱
vector<familyl> familyTree;
//用来保存一代的人数
vector<int> generationNum;
void bfs()
{
//族长入堆
que.push(01);
while (!que.empty())
{
//先找他的儿子入堆，再找其儿子的儿子入堆
int now = que.front(); que.pop();
//这里是来一个人，就在其相应的那一代的genrationNum上加一，初始值为零
int generationOfNow = familyTree[now].generation;
generationNum[generationOfNow]++;
if (generationNum[generationOfNow] > maxNumOfGeneration)
{
maxNumOfGeneration = generationNum[generationOfNow];
//这里是为了找出最大人数的是哪一代（layer）
layer = generationOfNow;
}
//把孩子入堆
for (int i = 0; i < familyTree[now].numOfChild; i++)
{
int id = familyTree[now].child[i];
//cout << "id: " << id << endl;
que.push(id);
//孩子id的代数generation是在now的基础上加一的
familyTree[id].generation = familyTree[now].generation + 1;
}
}
}

int main()
{
cin >> m >> n;
familyTree.resize(m+1);
generationNum.resize(m + 1, 0);
vector<int> child;
//输入谱
for (int i = 0; i < n; i++)
{
int self, numOfChild;
cin >> self >> numOfChild;
child.resize(numOfChild);
for (int j = 0; j < numOfChild; j++)
{
cin >> child[j];
}
//这里将所有代数都置一了，因为族长为第一代
familyTree[self] = familyl( numOfChild, 1,child);
}
bfs();
cout << maxNumOfGeneration << " " << layer << endl;
return 0;
}

#### PAT 1005 The Largest Generation (25)

2017-12-07 23:30:28

#### PAT：The Largest Generation (25)

2016-12-20 18:22:24

#### 1094. The Largest Generation (25) 此题和六度空间一个道理，记录BFS的层次

2015-03-14 21:23:34

#### 牛客网PAT题目1001——A+B和C（Java）

2017-11-22 16:00:33

#### 浙大pat | 浙大pat 牛客网PAT顶级(Top Level)练习题 1001

2018-02-12 18:51:28

#### 【PAT 1005 The Largest Generation (25)】& 树 & dfs

2017-09-05 16:22:18

#### 1094. The Largest Generation (25)

2016-04-11 16:05:24

#### PAT B1016 -- 部分A+B

2018-03-27 16:51:17

#### PAT A 1094. The Largest Generation (25)

2015-03-19 18:20:38

#### 1094. The Largest Generation (25)

2015-03-16 11:26:20