PAT (Advanced Level) Practice A1053 Path of Equal Weight （30 分）(C++)（甲级）（树、遍历，vector）

原题链接：A1053 Path of Equal Weight

#include<algorithm>
#include<iostream>
#include<cstdio>
#include <vector>
using namespace std;

typedef struct PTNode
{
    int weight;//权重
    vector<int> child;//用vector的STL存放孩子ID号
}PTNode;
PTNode PTree[100];//至多100个节点
int N, M, S, K;
int Stack[100], top = 0;//栈

bool cmp(int a, int b)
{
    return PTree[a].weight > PTree[b].weight;//按照权重对孩子排序
}

void DFS(int ID, int sum)//深度优先搜索思想，或者说先根遍历思想
{
    vector<int> Child = PTree[ID].child;
    if(Child.size() == 0)//无孩子，则说明该分支结束
    {
        if(sum == S)//该分支权值和满足题意，则打印栈中存储的权重
        {
            printf("%d", Stack[0]);
            for(int i=1; i<top; i++)
            {
                printf(" %d", Stack[i]);
            }
            printf("\n");
        }
        return ;
    }
    sort(Child.begin(), Child.end(), cmp);//按照权重对孩子排序
    for(vector<int>::iterator it = Child.begin(); it != Child.end(); it++)
    {
        Stack[top++] = PTree[*it].weight;//先把孩子权重入栈
        DFS(*it, sum+PTree[*it].weight);//该孩子完成递归后出桟
        top--;//不然会影响另一条分支上的权重之和
    }
}

int main()
{
    int i, j, ID, child_ID;
    scanf("%d %d %d", &N, &M, &S);
    for(i=0; i<N; i++)
    {
        scanf("%d", &PTree[i].weight);
    }
    for(i=0; i<M; i++)
    {
        scanf("%d %d", &ID, &K);
        for(j=0; j<K; j++)
        {
            scanf("%d", &child_ID);
            (PTree[ID].child).push_back(child_ID);
        }
    }
    Stack[top++] = PTree[0].weight;//先把根节点的权重入栈
    DFS(0, PTree[0].weight);
    return 0;
}