题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1812
思路:这题只能用来训练我极弱的code能力了。。。
设
f[i][j][k]
为以
i
为根的子树,有
注意写树形背包的时候要先赋好初值,然后暴力合并,注意把叶子节点和普通节点分开写会比较好。
值得一提的是树形
代码:
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#define N 102
#define K 52
using namespace std;
typedef long long LL;
struct edge { LL nxt,point,v,w;};
edge e[N << 1];
LL n,k,fa[N],w[N],d[N],f[N][K][N],dis[N][N],cnt,last;
//f[i][j][k]表示以i为根的子树 有j个场 且离i最近的在j的最小值,转移的时候要背包一下:复杂度:O(n^2*k^2)
inline int getnum(){
char c;int num;
while (!isdigit(c = getchar()));
num = (c ^ 48);
while (isdigit(c = getchar())) num = (num << 1) + (num << 3) + (c ^ 48);
return num;
}
inline void add(int u1,int v1,int w1){
e[++cnt].nxt = e[u1].point; e[u1].point = cnt; e[cnt].v = v1; e[cnt].w = w1; }
inline void insert(int u1,int v1,int w1){
add(u1,v1,w1); add(v1,u1,w1); }
inline void init(){
n = getnum(); k = getnum() + 1;
cnt = 0;
for (int i = 1;i <= n; ++i){
w[i] = getnum(); fa[i] = getnum(); d[i] = getnum();
insert(i,fa[i],d[i]);
}
fa[0] = -1;
for (int i = 0;i <= n; ++i)
for (int j = 0;j <= k; ++j)
for (int o = 0;o <= n; ++o)
f[i][j][o] = (1LL << 30LL);
memset(dis,0,sizeof(dis));
for (int i = 1;i <= n; ++i){
dis[i][i] = 0;
last = i;
for (int j = fa[i];j >= 0;last = j,j = fa[j]) dis[j][i] = dis[last][i] + d[last]; }
}
inline void dfs(int x){
LL mini,num = 0;
for (int p = e[x].point;p;p = e[p].nxt)
if (e[p].v != fa[x]) { dfs(e[p].v); ++num;}
if (!num){
f[x][1][x] = 0;
for (int j = fa[x];j >= 0; j = fa[j]) f[x][0][j] = w[x] * dis[j][x];
}
else {
for (int j = x;j >= 0; j = fa[j]){
if (x == j) f[x][1][x] = 0;
else f[x][0][j] = 0;
for (int p = e[x].point;p;p = e[p].nxt)
if (e[p].v != fa[x])
for (int o1 = k;o1 >= 0; --o1){
mini = (1LL << 30LL);
for (int o2 = o1;o2 >= 0; --o2)
mini = min(mini,f[x][o1 - o2][j] + min(f[e[p].v][o2][j],f[e[p].v][o2][e[p].v]));
f[x][o1][j] = mini;
}
for (int i = 0;i <= k; ++i) f[x][i][j] += w[x] * dis[j][x];
}
}
}
int main(){
init();
dfs(0);
cout<<f[0][k][0];
return 0;
}
总结:只有多写多练才能进步!