PAT 1004 Counting Leaves

没说明说的吧。如果想用bfs的话。在pop的时候更新深度比较好。

#include <cstdio>
#include <queue>
#include <algorithm>
#include <iostream>
#include <time.h>
#include <vector>
using namespace std;

const int maxn = 111;

struct Node{
    int data;
    vector<int> child;
}node[maxn];
int N,M;
int seniority[maxn]={0};
int maxdepth = -1;

void dfs(int root, int depth)
{
    if(node[root].child.size()==0)
    {
        if(depth>maxdepth)
            maxdepth = depth;
        seniority[depth] += 1;
    }

    int ss = node[root].child.size();
    for(int i =0;i<ss;i++)
        dfs(node[root].child[i], depth+1);

}

int main()
{
    int i,j,k,tmp,ch;
    scanf("%d %d",&N,&M);
    for(i=0;i<M;i++)
    {
        scanf("%d %d",&tmp,&k);
        node[tmp].child.clear();
        for(j=0;j<k;j++)
        {
            scanf("%d",&ch);
            node[tmp].child.push_back(ch);
        }
    }

    dfs(1,1);

    //int ans = 0;
    for(i=1;i<=maxdepth;i++)
        if(i==maxdepth)
            printf("%d",seniority[i]);
        else
            printf("%d ",seniority[i]);

    return 0;
}