1094 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:
1  ID K ID[1] ID[2] ... ID[K] 
where ID
is a twodigit number representing a family member, K
(>0) is the number of his/her children, followed by a sequence of twodigit 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:
1  23 13 
Sample Output:
1  9 4 
思路
给出树中每个节点的子节点，并且根节点为01，求解树中包含节点最多的一层以及节点数量
在跟节点开始，BFS向深处遍历，即可得到每一层包含的节点，判断出包含最多的一层即可
程序
1 
