PAT A1053 Path of Equal Weight

题意：从给出的多叉树中，找到从根到叶的某一权值总和的路径，并根据节点权值从大到小输出。

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 Figure 1: 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 Figure 1.
 

Input:

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~ (&lt1000) corresponds to the tree node T~i~. Then M lines follow, each in the format:

ID K ID[1] ID[2] ID[3]....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:

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 {A~1~, A~2~, ..., A~n~} is said to be greater than sequence {B~1~, B~2~, ..., B~m~} if there exists 1 <= k < min{n, m} such that A~i~ = B~i~ for i=1, ... k, and A~k+1~ > B~k+1~.

代码如下：

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
const int maxn = 110;

struct Node {
	int id;
	int w;
	vector<int> child;
}node[maxn];

bool cmp(int a, int b)
{
	return node[a].w> node[b].w;
}

void Traceback(Node root, long long int cw,long long int S,vector<int> &bestx)
{
	cw += root.w;
	//printf("%lld\n",cw);
	if (cw > S) return;
	if (cw == S&&root.child.size()==0)
	{
		for (int i = 0; i < bestx.size(); i++)
		{
			if (i != bestx.size()-1)
			{
				printf("%d ", node[bestx[i]].w);
			}
			else
				printf("%d\n", node[bestx[i]].w);

		}

		return;
	}
	for (int i = 0; i < root.child.size(); i++)
	{
		int tmp = root.child[i];
		bestx.push_back(tmp);
		Traceback(node[tmp], cw, S, bestx);
		bestx.pop_back();
	}
}

int main()
{
	int N, M;
	long long int S;
	scanf("%d%d%lld",&N, &M, &S);
	for (int i = 0; i < N; i++)
	{
		scanf("%d", &node[i].w);
		node[i].id = i;
	}
	for (int i = 0; i < M; i++)
	{
		int tmpId,K;
		scanf("%02d", &tmpId);
		scanf("%d", &K);
		for (int j = 0; j < K; j++)
		{
			int x;
			scanf("%d", &x);
			node[tmpId].child.push_back(x);
		}
		sort(node[tmpId].child.begin(), node[tmpId].child.end(), cmp); //用vector的迭代器
	}
	vector<int> ansx;
	ansx.push_back(0);
	Traceback(node[0], 0, S, ansx);
	system("pause");
	return 0;
}

/* 测试数据
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

输出：
10 5 2 7
10 4 10
10 3 3 6 2
10 3 3 6 2
*/

（1）这是一棵一般的多叉树，故可用vector<int> child 表示其子结点集合

（2）最后输出要按权值从大到小排序，故在输入时即可对vector进行排序。此处定义了cmp函数，注意比较的node数组中两个node结点的w值，结果为真时前面的参数a会排在b之前。

（3）树的根结点确定，故开始时直接将其加入ansx，并且cw也要保存其值。

（4）这里树的遍历都是先进入子结点，在进入后再判断其与S的大小关系：若大于S，直接返回；若等于S，还要判断是否到达叶子结点；若小于S，j继续递归。

递归过程中保存路径的方法：
①使用path[]数组表示路径，path[i]表示路径上第i个结点的编号，使用初值为0的numNode作为下标，作为递归层数。

②使用vector，用push_back()追加、pop_back()删除。