PAT (Advanced Level) 1094. The Largest Generation (25) 人数最多的一代，BFS

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。

/*2015.7.31cyq*/
#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;

//ifstream fin("case1.txt");
//#define cin fin

int main(){
	int N,M;
	cin>>N>>M;
	vector<vector<int> > tree(N+1);
	int root,num,x;
	while(M--){
		cin>>root>>num;
		for(int i=0;i<num;i++){
			cin>>x;
			tree[root].push_back(x);
		}
	}

	queue<int> cur,next;
	cur.push(1);
	int level=0;		//当前层
	int levelCount=0;	//当前层的结点数
	int maxCount=0;		//最大结点数
	int maxLevel=0;		//最大结点数所在的层
	while(!cur.empty()){
		level++;
		levelCount=cur.size();
		if(levelCount>maxCount){
			maxCount=levelCount;
			maxLevel=level;
		}
		while(!cur.empty()){
			int tmp=cur.front();
			cur.pop();
			for(auto it=tree[tmp].begin();it!=tree[tmp].end();++it)
				next.push(*it);
		}
		swap(cur,next);
	}
	cout<<maxCount<<" "<<maxLevel;
	return 0;
}