pat甲级 1053 Path of Equal Weight (30point(s))

Given a non-empty tree with root R, and with weight W​i
​assigned to each tree node T​i . The weight of a path from R to L is defined to be the sum of the weights of all the nodes along the path from R to any leaf node L.Now given any weighted tree, you are supposed to find all the paths with their weights equal to a given number. For example, let’s consider the tree showed in the following figure: for each node, the upper number is the node ID which is a two-digit number, and the lower number is the weight of that node. Suppose that the given number is 24, then there exists 4 different paths which have the same given weight: {10 5 2 7}, {10 4 10}, {10 3 3 6 2} and {10 3 3 6 2}, which correspond to the red edges in the figure.
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, M (<N), the number of non-leaf nodes, and 0<S<2^30, the given weight number. The next line contains N positive numbers where W​i​​ (<1000) corresponds to the tree node T​i​​ . 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 00.
Output Specification:
For each test case, print all the paths with weight S in non-increasing order. Each path occupies a line with printed weights from the root to the leaf in order. All the numbers must be separated by a space with no extra space at the end of the line.

Note: sequence {A1 ,A​2,⋯,An} is said to be greater than sequence {B​​​ ,B​2​​ ,⋯,B​m​​ } if there exists 1≤k<min{n,m} such that A​i​​ =B​ifor i=1,⋯,k, and A​k+1 >B​k+1
Sample Input:
20 9 24
10 2 4 3 5 10 2 18 9 7 2 2 1 3 12 1 8 6 2 2
00 4 01 02 03 04
02 1 05
04 2 06 07
03 3 11 12 13
06 1 09
07 2 08 10
16 1 15
13 3 14 16 17
17 2 18 19
​​ .Sample Output:
10 5 2 7
10 4 10
10 3 3 6 2
10 3 3 6 2
题意很简单给定一颗树然后找出其长度等于给定值的路径输出，路径输出顺序为序号非递增输出（先将每个节点的孩子结点排序即可完成）
一开始我打算用vector来存储路径，然后发现输出的路径奇奇怪怪的，百度一下发现是clear（)函数与我想象的–直接将容器元素删除size为0不太一样。而利用pop_back()则不会出现问题；`
一开始的代码：

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
const int maxn=101;
int s;
struct Node{
int weight;
vector<int>child;
}node[maxn];
vector<int>path;//存储路径
bool cmp(int a,int b){
    return node[a].weight>node[b].weight;
}
void   dfs( int index,int sum){
    sum+=node[index].weight;
    path.push_back(index);
if(sum>s){
path.clear();
return;
}
else if(sum==s){
if(node[index].child.size()!=0){
path.clear();
return ;
}
else{
printf("%d",node[path[0]].weight);
for(int i=1;i<path.size();i++){
    printf(" %d",node[path[i]].weight);
}
printf("\n");
path.clear();
return ;
}

}
else{//sum<s;
for(int i=0;i<node[index].child.size();i++){
dfs(node[index].child[i],sum);
}
}
}
int main(){
    int n,m;
    scanf("%d %d %d",&n,&m,&s);
    for(int i=0;i<n;i++){
        scanf("%d",&node[i].weight);
    }
    int  temp1,num,temp2;
    for(int i=0;i<m;i++){
        scanf("%d %d",&temp1,&num);
        for(int j=0;j<num;j++){
            scanf("%d",&temp2);
            node[temp1].child.push_back(temp2);
        }
        sort(node[temp1].child.begin(),node[temp1].child.end(),cmp);
    }
    dfs(0,0);
    system("pause");
    return 0;
}

AC代码

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
const int maxn=101;
int s;
struct Node{
int weight;
vector<int>child;
}node[maxn];
vector<int>path;//存储路径
bool cmp(int a,int b){
    return node[a].weight>node[b].weight;
}
void   dfs( int index,int sum){
    sum+=node[index].weight;
    path.push_back(index);
if(sum>s){
    path.pop_back();
return;
}
else if(sum==s){
if(node[index].child.size()!=0){
    path.pop_back();
return ;
}
else{
printf("%d",node[path[0]].weight);
for(int i=1;i<path.size();i++){
    printf(" %d",node[path[i]].weight);
}

printf("\n");
path.pop_back();
return ;
}

}
else{//sum<s;
for(int i=0;i<node[index].child.size();i++){
dfs(node[index].child[i],sum);
}
}
path.pop_back();
}
int main(){
    int n,m;
    scanf("%d %d %d",&n,&m,&s);
    for(int i=0;i<n;i++){
        scanf("%d",&node[i].weight);
    }
    int  temp1,num,temp2;
    for(int i=0;i<m;i++){
        scanf("%d %d",&temp1,&num);
        for(int j=0;j<num;j++){
            scanf("%d",&temp2);
            node[temp1].child.push_back(temp2);
        }
        sort(node[temp1].child.begin(),node[temp1].child.end(),cmp);
    }
    dfs(0,0);
    system("pause");
    return 0;
}