1094 The Largest Generation(甲级)

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

#include<iostream>
#include<vector>
using namespace std;
const int maxn = 101;
struct info//定义静态树
{
	vector<int>v;
}node[maxn];
int depth_no[maxn]{ 0 };//记录每层的节点数目
void dfs(int root, int depth)
{
	depth_no[depth]++;//该层节点数加一
	for (int i = 0; i < node[root].v.size(); i++)
	{
		dfs(node[root].v[i], depth + 1);//遍历所有孩子节点，进行递归
	}
}
int main()
{
	int n, m, parent, k, child;
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		cin >> parent >> k;//父亲节点编号，孩子个数
		for (int j = 0; j < k; j++)
		{
			cin >> child;
			node[parent].v.push_back(child);
		}
	}
	dfs(1, 1);
	int max_level;//记录最大节点数在第几层
	int max_num = -1;//记录最大的节点数
	for (int i = 0; i < maxn; i++)
	{
		if (depth_no[i] > max_num)
		{
			max_num = depth_no[i];
			max_level = i;
		}
	}
	cout << max_num << " " << max_level;
}