PAT 1004 Counting Leaves (30分)

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input Specification:
Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nodes in a tree, and M (<N), the number of non-leaf nodes. Then M lines follow, each in the format:

ID K ID[1] ID[2] … ID[K]
where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID’s of its children. For the sake of simplicity, let us fix the root ID to be 01.

The input ends with N being 0. That case must NOT be processed.

Output Specification:
For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.

The sample case represents a tree with only 2 nodes, where 01 is the root and 02 is its only child. Hence on the root 01 level, there is 0 leaf node; and on the next level, there is 1 leaf node. Then we should output 0 1 in a line.

Sample Input:

2 1
01 1 02

Sample Output:

0 1

题目大意：
计算每层的叶子数目，并按层数依次输出叶子数

考察树的遍历
通过DFS遍历整棵树，并设一个已层数为下标的叶子数组，当遇到叶子时就对应下标的数组值值加一，最后遍历数组

我的代码

#include<cstdio>
const int maxn = 110;
struct Node
{
    int len;
    int child[maxn];
}node[maxn];
int leave[maxn] = {0},maxdepth = -1;
void DFS(int root,int depth)
{
    if(node[root].len == 0)
        leave[depth]++;
    if (depth > maxdepth)
        maxdepth = depth;
    for (int i = 0 ;i < node[root].len ;i++)
    {
        DFS(node[root].child[i],depth+1);
    }
}
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for (int i = 0 ;i < m ;i++)
    {
        int fid,k;
        scanf("%d%d",&fid,&k);
        for (int j = 0 ;j < k ;j++)
        {
            int cid;
            scanf("%d",&cid);
            node[fid].child[j] = cid;
            node[fid].len++;
        }        
    }
    DFS(1,0);
    for (int i = 0 ;i <= maxdepth ;i++)
    {
        printf("%d",leave[i]);
        if (i < maxdepth)
            printf(" ");
    }
    return 0;
}