题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805521431773184
没啥好说的。。就是一开始根结点序号弄错了，还有输出循环时下标漏了一个，改完就AC了

代码

  1. #include<algorithm>
  2. #include<vector>
  3. #include<iostream>
  4. using namespace std;
  6. const int maxn = 110;
  7. struct Node{
  8.     int depth;
  9.     vector<int> child;
  10. }node[maxn];
  12. int hash_table[maxn] = {0};
  14. int n, m, tree_depth = 0;
  15. void DFS(int root, int depth){
  16.     if(node[root].child.size() == 0){
  17.         tree_depth = max(depth, tree_depth);
  18.         hash_table[depth]++;
  19.         return;
  20.     }
  21.     for(int i = 0; i < node[root].child.size(); i++){
  22.         int child = node[root].child[i];
  23.         DFS(child, depth + 1);
  24.     }
  25. }
  27. int main(){
  28.     int node_id, child_num, child_temp;
  29.     scanf("%d%d", &n, &m);
  30.     for(int i = 0; i < m; i++){
  31.         scanf("%d%d", &node_id, &child_num);
  32.         for(int i = 0; i < child_num; i++){
  33.             scanf("%d",&child_temp);
  34.             node[node_id].child.push_back(child_temp);
  35.         }
  36.     }
  38.     DFS(1, 0);
  39.     for(int i = 0; i <= tree_depth; i++){
  40.         printf("%d", hash_table[i]);
  41.         if(i != tree_depth) printf(" ");
  42.     }
  43.     return 0;
  44. }