1053. Path of Equal Weight (30)

#include<cstdio>
#include<vector>
#include<algorithm>
#define maxn 110
using namespace std;

struct node
{
  int weight;
  vector<int> child;
}tree[maxn];

int N,M,K,S,id;
int path[maxn]={0};
bool cmp(int a, int b)
{
  return tree[a].weight>tree[b].weight;
}

//DFS求解
void DFS(int index, int numNode, int sum)
{
  if(sum > S) return;
  if(sum == S)
  {
    //不是叶子节点，直接返回
    if(tree[index].child.size() != 0) return;
    //是叶子节点，这是一条完整的路径，输出
    for(int i=0; i<numNode; i++)
    {
      printf("%d",tree[path[i]].weight);
      if(i < numNode-1) printf(" ");
      else  printf("\n");

    }
  }
  //小于S的情况，依次对每个孩子进行深度遍历，
  for(int i=0; i<tree[index].child.size(); i++)
  {
    int child = tree[index].child[i];
    path[numNode] = child;
    DFS(child, numNode+1,sum+tree[child].weight);
  }
}
int main()
{
  //读入数据
  scanf("%d%d%d",&N,&M,&S);
  for(int i=0; i<N; i++)
  {
    scanf("%d",&tree[i].weight);
  }
  for(int i=0; i<M; i++)
  {
    scanf("%d%d",&id,&K);
    for(int j=0; j<K; j++)
    {
      int temp;
      scanf("%d",&temp);
      tree[id].child.push_back(temp);
    }
    //给孩子的权重排序
    sort(tree[id].child.begin(),tree[id].child.end(),cmp);
  }
  path[0] = 0;
  //求解路径，
  DFS(0, 1, tree[0].weight);
  return 0;
}