1004. Counting Leaves (30)

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 105;
struct Node
{
    int father;
    int level;
    bool NoChild;
};

Node v[maxn];
int level[maxn];

int main()
{
    int N,M,i,j,c,ID,child;
    int MAXLevel = 1;
    scanf("%d%d",&N,&M);
    for(i=0;i<100;i++)
    {
        v[i].father=0;
        v[i].level=0;
        v[i].NoChild=1;
    }
    for(i=0;i<M;i++)
    {
        scanf("%d%d",&ID,&c);
        v[ID].NoChild=0;
        for(j=0;j<c;j++)
        {
            scanf("%d",&child);
            v[child].father = ID;
        }
    }

    v[1].level=1;
    for(i=1;i<=N;i++)
        for(j=1;j<=N;j++)
        {
            //如果其根节点是i
            if(v[j].father==i)
            {
                v[j].level = v[v[j].father].level+1;
                if(v[j].level > MAXLevel)
                    MAXLevel = v[j].level;
            }
        }

    for(i=1;i<=N;++i)
        if(v[i].NoChild==1)
            level[v[i].level]++;
    for(i=1;i<MAXLevel;++i)
        printf("%d ",level[i]);
    printf("%d
",level[i]);
    return 0;
}