PAT甲级--1094 The Largest Generation（25 分）【DFS+BFS+输出一层最多的结点数】

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

解题思路：这题可以用dfs和bfs，跟之前的一题基本上可以说是一样的，就是输出来的东西不一样，首先是邻接表来存储树，然后dfs或者bfs，他们共同的点是孩子的层数是父亲节点的层数加1，具体的还是见代码。

BFS：

#include<bits/stdc++.h>
using namespace std;
vector<int>v[100];
int level[100],cnt[100];
int main(void)
{
	int n,m,p,c,k;
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++)
    {
    	scanf("%d %d",&p,&k);
    	for(int j=0;j<k;j++)
    	{
    		scanf("%d",&c);
    		v[p].push_back(c);
	}
    }
	queue<int>q;
	q.push(1);
	level[1]=1;
	while(!q.empty())
	{
		int root=q.front();
		q.pop();
		cnt[level[root]]++;
		for(int i=0;i<v[root].size();i++)
		{
			level[v[root][i]]=level[root]+1;
			q.push(v[root][i]);
		}
		
	}
	int maxp=0,maxl=1;
	for(int i=0;i<100;i++)
	{
		if(cnt[i]>maxp)
		{
			maxp=cnt[i];
			maxl=i;
		}
	}
	printf("%d %d",maxp,maxl);
	return 0;
}

DFS：

#include<bits/stdc++.h>
using namespace std;
vector<int>v[100];
int cnt[100];
void dfs(int root,int level)
{
	cnt[level]++;
	for(int i=0;i<v[root].size();i++)
	dfs(v[root][i],level+1);
 } 
int main(void)
{
	int n,m,p,c,k;
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++)
    {
    	scanf("%d %d",&p,&k);
    	for(int j=0;j<k;j++)
    	{
    		scanf("%d",&c);
    		v[p].push_back(c);
	}
   }

	dfs(1,1);
	int maxp=0,maxl=1;
	for(int i=0;i<100;i++)
	{
		if(cnt[i]>maxp)
		{
			maxp=cnt[i];
			maxl=i;
		}
	}
	printf("%d %d",maxp,maxl);
	return 0;
}