1094 The Largest Generation

最新推荐文章于 2024-06-02 16:33:44 发布

就是爱喝百香果冷饮

最新推荐文章于 2024-06-02 16:33:44 发布

阅读量254

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/qq_37617419/article/details/88858263

PAT 专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种通过递归深度优先搜索算法统计家族树中各代人数的方法，并实现了寻找人数最多的代的任务。输入包括家族成员总数及有子女的成员信息，输出最大人口数量及其对应的代数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1094 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.

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
题意：
输入树的结点个数N,非叶子结点个数M,然后输入M个非叶子结点各自的孩子结点编号，求结点个数最多的一层，（根结点层号为1）。

#include<cstdio>
#include<vector>
using namespace std;
const int maxn=110;
vector<int> Node[maxn];
int hashTable[maxn]={0};//记录每层的结点个数
void DFS(int index,int level)
{
	hashTable[level]++;
	for(int j=0;j<Node[index].size();j++)
	{
		DFS(Node[index][j],level+1);
	}
} 
int main()
{
	int n,m,parent,k,child;
	scanf("%d%d", &n, &m);
	for(int i=0;i<m;i++)
	{
		scanf("%d%d",&parent,&k);//父亲结点编号，孩子个数
		for(int j=0;j<k;j++)
		{
			scanf("%d", &child);//孩子结点编号
			Node[parent].push_back(child);//建树 
		} 
	}
	DFS(1,1);//根结点为1号结点，层号为1
	int maxLevel=-1,maxValue=0;
	for(int i=1;i<maxn;i++) 
	{
		if(hashTable[i]>maxValue)
		{
			maxValue=hashTable[i];
			maxLevel=i;
		}
	}
	printf("%d %d\n",maxValue,maxLevel);//输出最大结点数与该层层号
	return 0; 
}