思路
1.N:结点总数 M:父结点数==输出行数!=树的层数
2.注意所给的父结点不一定是自根结点向下输入,顺序未知
3.用并查集
4.Hierarchy每层的叶子结点 = 所有结点树(计算层数)- 给出的父结点(找出父结点的所在层)
#include<iostream>
using namespace std;
int N, M;//结点总数,父结点数(输入行数)
int Leaves[110]{ 0 };//子节点
int Hierarchy[110]{ 0 };//每层的结点数
bool F_Leaves[110]{ false };
int main() {
int node, H, maxH = 0, maxL = 0;
cin >> N >> M;
if (N == 0) return 0;//空树
if (N == 1) { cout << "1\n"; return 0; }//仅有根结点
int root, ID, K;
for (int i = 0; i < M; i++) {
scanf("%2d %d", &root, &K);
F_Leaves[root] = true;//标记非叶子结点
maxL = maxL > root ? maxL : root;
for (int j = 0; j < K; j++) {
scanf("%2d", &ID);
Leaves[ID] = root;
maxL = maxL > ID ? maxL : ID;
}
}
for (int i = 1; i <= maxL; i++) {
if (i != 1 && Leaves[i] == 0) continue;//该结点不存在
node = i, H = 0;
while (Leaves[node] != 0) {
H++;
node = Leaves[node];
}
Hierarchy[H]++;//计算每层的结点总数
maxH = maxH > H ? maxH : H;
//当前结点得父结点对应得那一层得叶子结点数要减去该父结点
if (Leaves[i] != 0 && F_Leaves[Leaves[i]] == true) {//减去每层父结点数
Hierarchy[H - 1]--;//留意根结点没有父结点
F_Leaves[Leaves[i]] = false;//证明该父结点已经减去,不重复减
}
}
for (int i = 0; i <= maxH; i++)
printf(i != maxH ? "%d " : "%d\n", Hierarchy[i]);
return 0;
}