PAT 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

二叉树的层次遍历
利用vector数组来实现二叉树模型。
每层要有一个计数器num，每次push的时候都加1。标记某层的节点数。在cnt == 0时给cnt = num。
每次判断队列是否空时，计数器cnt就减1，标记一层是否结束。
还有某层标记：level。
每轮cnt为0时，都要检查Max和MaxLevel。
输出结果。

#include<iostream>
#include<vector>
#include<queue>

using namespace std;
int N,M;
int Largest = 0,Level = 0;
queue<int> q;
vector<int> v[101];
bool flag = false;

void BFS(int id,int &level) {
	int top,num = 0;
	int cnt = 1;
	while(!q.empty()) {
		cnt--;
		if(cnt == 0) {
			flag = !flag;
			level++;
		}
		top = q.front();
		q.pop();
		for(int i = 0; i < v[top].size(); i++) {
			q.push(v[top][i]);
			num++;
		}
		if(flag) {
			cnt = num;
			if(num > Largest) {
				Largest = num;
				Level = level + 1;
			}
			num = 0;
			flag = !flag;
		}
	}
}


int main() {
	int level = 0;
	cin>>N>>M;
	int ID,K;
	int id;
	for(int i = 0; i < M; i++) {
		cin>>ID>>K;
		for(int j = 0; j < K; j++) {
			cin>>id;
			v[ID].push_back(id);
		}
	}
	if(v[1].size() == 0) {
		cout<<1<<" "<<1;
		return 0;
	}
	q.push(1);
	BFS(0,level);
	cout<<Largest<<" "<<Level;

	return 0;
}

前辈传送门…