PAT-A-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

---

vector或者数组存储树

有点类似层序遍历，层序遍历是使用queue进行输出，但是我想了半天没有想出一个很好地办法计算每层的节点数量。

最后参考了别人的代码，使用vector来模拟，好处就在于可以使用erase直接删除上一代节点

 

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
	vector<int> nodes[100];           //保存树
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=0;i<m;i++){
		int pId,nCh;
		scanf("%d %d",&pId,&nCh);
		for(int j=0;j<nCh;j++){
			int temp;
			scanf("%d",&temp);
			nodes[pId].push_back(temp);      //谁的孩子谁装
		}
	}
	int max=0,level=1,t;
    vector<int> data;
	data.push_back(1);                      //把根节点装进去
	while(!data.empty()){
		int size=data.size();               //当代节点数量
		if(size>max){
			t=level;
			max=size;
		}
		for(int k=0;k<size;k++){
			for(int l=0;l<nodes[data[k]].size();l++){  //添加下一代节点
				data.push_back(nodes[data[k]][l]);
			}
		}
		data.erase(data.begin(),data.begin()+size);
		level++;

	}
	printf("%d %d",max,t);
return 0;
}