CCF-CSP 202012-04 食材运输代码+思路
思路:多重dp
固定一个出发点n,固定第k种货物 得出来g[k][n]
固定一个出发点n,取前k种货物,取dp[k][1]=min(∑g[k][n](k=0,1,2…))
取前n个出发点,取前k种货物,取dp[k][n]=min(dp[k-s][n-1]+dp[s][1])
代码:
#include
#include
using namespace std;
int n, m, k,v;
vector road[105];
vector need[105];
int w[105] = { 0 };
int dp[10][1 << 10]; //前i个出发点配送前j个食材dp[i][j]=min{dp[i-1][j-s],dp[1][s]
int calone(int fa,int k) { //一个出发点送一种食材要的花费
for (int i = 1; i <= n; i++) {
}
return 0;
};
int cal(int fa, int des) {
int sum = 0;
if (need[des][v] == 0) sum = 0;
for (int i = 0; i < road[des].size(); i++) {
// if (road[des][i]!=fa)
}
return 0;
};
int we() { //前i个出发点配送前j个食材dp[i][j]=min{dp[i-1][j-s],dp[1][s-
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
need[i].push_back(tmp);
}
}
for (int i = 1; i < n; i++) { //road,need,w下标均以1开始
int x, y, weight;
cin >> x >> y >> weight;
road[x].push_back(y);
road[y].push_back(x);
w[i] = weight;
}
dp[1][0] = 0;
for (int i = 1; i < 1 << k; i++) {
// dp[1][i] =
}
return 0;
}