[PAT A1094]The Largest Generation

[PAT A1094]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.

输入格式

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

解析

1.题目大意：给出n和m，n表示家族谱系中结点的个数，m表示有儿子结点的结点个数，然后要求我们求出人数最多的那一层结点和对应的层数，注意：默认根结点为第一层，默认根结点编号为1

2.题目很简单，通过率也很高，这里就不赘述了，直接贴代码：

#include<iostream>
#include<vector>
using namespace std;
const int maxn = 110;
struct node {
	int level = 0;  //存放结点的层数
	vector<int> children;
};
node tree[maxn];
int book[maxn] = { 0 };  //用于记录每层有多少个结点
void traverse(int i, int level);  //遍历函数
int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++) {
		int num, t, temp;
		scanf("%d %d", &num, &t);
		for (int j = 0; j < t; j++) {
			scanf("%d", &temp);
			tree[num].children.push_back(temp);
		}
	}
	traverse(1, 1);
	for (int i = 1; i <= n; i++) book[tree[i].level]++;
	int maxn = 1, max = book[1];
	for (int i = 1; i <= n; i++) {
		if (book[i] > max) {
			max = book[i];
			maxn = i;
		}
	}
	printf("%d %d", max, maxn);
	return 0;
}
void traverse(int i, int level) {
	tree[i].level = level;
	if (tree[i].children.empty()) return;
	for (int j = 0; j < tree[i].children.size(); j++) traverse(tree[i].children[j], level + 1);
}