1094 The Largest Generation (25 分) 统计树中每层的节点数,输出最大层节点数和节点序号
输入和PAT 1004题相似
第一行输入N,M,表示结点总数和非叶节点数,下面的M行输入
ID K ID[1] ID[2] ... ID[K]
ID是两位序号,K是孩子数,ID[1]~ID[k]是孩子序号。根节点序号为01
输出最大层节点数和节点序号
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
#include<cstdio>
#include<iostream>
#include<map>
#include<vector>
using namespace std;
map<int, vector<int> >mm;
int maxlevel = 0, tempnum[100] = { 0 };//tempnum数组记录每层的节点数
int maxnum = 0;
void dfs(int root,int level)
{
tempnum[level]++;
if (maxnum < tempnum[level])
{
maxnum = tempnum[level];
maxlevel = level;
}
for(int i=0;i<mm[root].size();i++)
{
dfs(mm[root][i], level+1);
//如果用dfs(mm[root][i], ++level),要有回溯操作:level-=1;
}
}
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for(int i=0;i<m;i++)
{
int id, child,nod;
scanf("%d%d", &id, &child);
for(int j=0;j<child;j++)
{
scanf("%d", &nod);
mm[id].push_back(nod);
}
}
dfs(1, 1);//根节点是01,根节点所在的层是第一层
cout << maxnum << " " << maxlevel << endl;
}