题目要求树中兄弟最多的一层的深度和这一层结点的个数。用邻接表来存这个树,BFS来求各个结点的层数。使用了一个数组a来保存每个结点的层数,然后递归求下一层结点层数,即它的双亲结点层数加1,邻接表中无后继元素那么递归结束。
#include<iostream>
using namespace std;
void ge(int* a, int** list, int t);
int main() {
int n, m;
cin >> n >> m;
int* a = (int*)malloc(sizeof(int)*(n + 1));//元素的值是它的层数
for (int i = 0;i <= n;i++) {
a[i] = 1;//从1层开始
}
int** list = (int**)malloc(sizeof(int*)*(n + 1));
for (int i = 0;i <= n;i++) {
list[i]=(int*) malloc(sizeof(int)*(n + 1));
for (int j = 0;j <= n;j++) {
list[i][j] = 0;
}
}
for (int i = 1;i <= m;i++) {
int node;
int k;
cin >> node;
cin >> k;
for (int j = 0;j < k;j++) {
cin >> list[node][j];
}
}
ge(a, list, 1);
int* num= (int*)malloc(sizeof(int)*(n + 1));
for (int i = 1;i <= n;i++) {
num[a[i]] = 0;
}
for (int i = 1;i <= n;i++) {
num[a[i]]++;
}
int max = 1, maxl = 1;
for (int i = 1;i <= n;i++) {
if (num[i] > max) {
maxl = i;
max = num[i];
}
}
cout << max << " " << maxl << endl;
return 0;
}
void ge(int* a, int** list,int t) {//t是当前结点标号,p是父亲结点
if (list[t][0] == 0) {
return;
}
int j = 0;
while (list[t][j] != 0) {
if (t != 1) {
a[list[t][j]] = a[t]+1;
}
else {
a[list[t][j]]++;
}
j++;
}
j = 0;
while (list[t][j] != 0) {
ge(a, list, list[t][j]);
j++;
}
}