POJ 2152 Fire （树形dp）

转发一篇国家队论文。
树形dp

对这题讲的挺清楚的。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<vector> 
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a));
#define lowbit(x)  x&-x;  
#define debugint(name,x) printf("%s: %d\n",name,x);
#define debugstring(name,x) printf("%s: %s\n",name,x);
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int maxn = 1e3+5;
const int mod = 1e9+7;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,m;
ll ans;
struct node{
	int to,nxt,w;
}e[maxn<<1];
int head[maxn],tot;
int dp[maxn][maxn],W[maxn],D[maxn],dis[maxn],best[maxn];
void add(int u,int v,int w){
	e[tot].to = v;
	e[tot].nxt = head[u];
	e[tot].w = w;
	head[u] = tot++;
}

void init(){
	mem(head,-1);
	tot = 0;
}

void dfsdis(int u){
	for(int i = head[u]; ~i; i = e[i].nxt){
		int to = e[i].to;
		if(dis[to] != -1) continue;
		dis[to] = dis[u] + e[i].w;
		dfsdis(to);
	}
}

void dfsans(int u,int fa){
	for(int i = head[u]; ~i; i = e[i].nxt){ //递归到叶子节点，从叶子节点开始 
		int to = e[i].to;
		if(to == fa) continue;
		dfsans(to,u);
	}
	for(int i = 1; i <= n; i++) dis[i] = -1;
	dis[u] = 0;
	best[u] = inf;
	dfsdis(u); //求以u为根的子树节点到u的距离 
	for(int i = 1; i <= n; i++) dp[u][i] = inf;
	for(int i = 1; i <= n; i++){
		if(dis[i] <= D[u]){
			dp[u][i] = W[i];
			for(int j = head[u]; ~j; j=e[j].nxt){
				int v = e[j].to;
				if(v == fa) continue;
				dp[u][i] += min(best[v],dp[v][i]-W[i]);
			}
			best[u] = min(dp[u][i],best[u]);
		}
	}
}
int main() {
	int t;
	scanf("%d",&t);
	while(t--){
		init();
		scanf("%d",&n);
		for(int i = 1; i <= n; i++)
			scanf("%d",&W[i]);
		for(int i = 1; i <= n; i++)
			scanf("%d",&D[i]);
		for(int i = 1,a,b,c; i < n; i++){
			scanf("%d%d%d",&a,&b,&c);
			add(a,b,c);
			add(b,a,c);
		}
		dfsans(1,0);
		printf("%d\n",best[1]);
	}
}