DFS解决图的遍历求和,需要注意的是此处必须要加到叶子节点才算,不是叶子节点就舍去。
附本人AC代码:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N, M, W, id, num, val;
struct Node {
int id, val;
};
vector<vector<int>>V, ans;
vector<int>tmp;
int weight[110];
bool cmp(vector<int>&A, vector<int>&B) {
int len = A.size() > B.size() ? B.size() : A.size();
for (int i = 0; i < len; i++) {
if (A[i] == B[i])continue;
else if (A[i] > B[i])return true;
else return false;
}
return A.size() > B.size();
}
void PRI(vector<int>V) {
for (int i = 0; i < V.size(); i++) {
if (i == 0)printf("%d", V[i]);
else printf(" %d", V[i]);
}
printf("\n");
}
void dfs(int root, int sum) {
if (sum + weight[root] > W)return;
tmp.push_back(weight[root]);
sum += weight[root];
if (sum == W) {
if(V[root].size()==0)ans.push_back(tmp);
tmp.pop_back();
return;
}
for (int i = 0; i < V[root].size(); i++) {
if (sum + weight[V[root][i]] <= W) {
dfs(V[root][i], sum);
}
}
tmp.pop_back();
}
int main() {
scanf("%d%d%d", &N, &M, &W);
V.resize(N);
for (int i = 0; i < N; i++)scanf("%d", &weight[i]);
for (int i = 0; i < M; i++) {
scanf("%d %d", &id, &num);
for (int j = 0; j < num; j++) {
scanf("%d", &val);
V[id].push_back(val);
}
}
dfs(0, 0);
sort(ans.begin(), ans.end(), cmp);
for (int i = 0; i < ans.size(); i++)PRI(ans[i]);
return 0;
}