PTA-甲级 1094 The Largest Generation 深度优先

PTA-甲级 1094 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.

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

算法： 深度优先搜索，同时计算每层的个数

// bfs核心
bool visit[n]; //判断结点是否访问过
vector<vector<int>> vec;// 存放点与点的连接关系
void dfs(int node, int height){ //node结点，height深度
	... ... // 一些定制化操作
	visit[node]=true;
	for(int i=0; i<vec[node].size(); i++){ //去相连的其他结点
		if(visit[vec[node][i]]){ // 如果该结点没有访问过
			dfs(vec[node][i],height+1); // 去下一层访问他
		}
	}
}

代码：

#include<iostream>
#include<vector>
using namespace std;
int n,m;
vector<vector<int>> vec;
bool visit[105];
int allh[105]; 
int maxx;
int dai;
void dfs(int node, int hei){
	allh[hei]=allh[hei]+1;
	if(allh[hei]>maxx){
		maxx=allh[hei];
		dai=hei;
	}
	visit[node]=true;
	for(int i=0; i<vec[node].size(); i++){
		if(visit[vec[node][i]]==false){
			dfs(vec[node][i],hei+1);
		}
	}
}
int main(){
	cin>>n>>m;
	fill(visit, visit+105, false);
	fill(allh, allh+105, 0);
	vec.resize(n+5);
	for(int i=0; i<m; i++){
		int fa,num,son;
		cin>>fa>>num;
		for(int j=0; j<num; j++){
			cin>>son;
			vec[fa].push_back(son);
		}
	}
	maxx=0;
	dai=-1;
	dfs(1,1);
	cout<<allh[dai]<<' '<<dai<<endl;
}