1004 Counting Leaves （30 分）

#include <iostream>
using namespace std;
typedef struct {
    int level;//節點所在層次
    int flag;//0沒有孩子，1有孩子
    int father;//父節點
}Node;
int main()
{
    Node node[205];
    int n, m;//n個節點,m個非葉子節點
    int nowNode, nowNodeNumber, childNode;
    int result[205] = { 0 };
    int maxLevel = 1;
    cin >> n >> m;

    //初始化
    for (int i = 0;i <= n; i++) {
        node[i].level = 0;
        node[i].flag = 0;
        node[i].father = 0;
    }
    //編號爲1的根節點層號爲1
    node[1].level = 1;
    //輸入並保存關係
    while (m--) {
        cin >> nowNode;//節點編號
        cin >> nowNodeNumber;//孩子數
        //標記該節點有孩子
        if (nowNodeNumber > 0) {
            node[nowNode].flag = 1;
        }
        for (int j = 0;j < nowNodeNumber;j++) {
            cin >> childNode;
            //保存本身的父親節點
            node[childNode].father = nowNode;   
        }
    }

    for (int i = 1;i <= n;i++) {
        for (int j = 0;j <= n;j++) {
            if (node[j].father == i) {
                node[j].level = node[i].level + 1;
            }
        }
    }
    for (int i = 1;i <= n;i++) {
        if (node[i].flag == 0) {//葉節點
            result[node[i].level]++;
        }
        //記錄下最大的層號
        if (node[i].level > maxLevel) {
            maxLevel = node[i].level;
        }
    }

    for (int i = 1;i < maxLevel;i++) {
        cout << result[i] << " ";
    }
    cout << result[maxLevel];
    return 0;
}

參考博客：http://www.cnblogs.com/linkstar/p/5674895.html