hdu 6662 ( Acesrc and Travel )

这题我的收获有两个，一个是无向图的树形dp，本质上是有根树的dp加上父边反向的dp。另一个是这题边界条件比较多，如果用特判的话比较难写，应该 给每一个数组赋初始值，免去了特判的过程。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef int lint;
const int maxn = 100005;
const int maxm = 200005;
const LL inf = 0x3f3f3f3f3f3f;
int ver[maxm],he[maxn],ne[maxm],tot;
LL val[maxn];
void add( int x,int y ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
}
LL dp1[maxn][2],dp2[maxn][2];
int son[maxn][2];
int du[maxn];
void dfs(LL u, LL fa){
    if(du[u] == 1 && u != 1)dp1[u][0] = dp1[u][1] = val[u];
    for(LL v, i = he[u]; i; i = ne[i]){
        if((v = ver[i]) == fa)continue;
        dfs(v, u);
        if(dp1[u][0] < dp1[v][1] + val[u]){
            dp2[u][0] = dp1[u][0];
            dp1[u][0] = dp1[v][1] + val[u];
            son[u][0] = v;
        }else dp2[u][0] = max(dp2[u][0], dp1[v][1] + val[u]);

        if(dp1[u][1] > dp1[v][0] +val[u]){
            dp2[u][1] = dp1[u][1];
            dp1[u][1] = dp1[v][0] + val[u];
            son[u][1] = v;
        }else dp2[u][1] = min(dp2[u][1], dp1[v][0] + val[u]);
    }
}
LL g[maxn][2];
void dfs2( int x,int fa ){
    for( int cure = he[x];cure;cure = ne[cure] ){
        int y = ver[cure];
        if( y == fa ) continue;
        //g[y][0]
        if( son[x][0] == y && dp2[x][0] != -inf ){
            g[y][1] = dp2[x][0] + val[y];
        }else if( son[x][0] != y ){
            g[y][1] = dp1[x][0] + val[y] ;
        }
        if( g[x][0] !=inf )g[y][1] = max( g[y][1],g[x][0]+val[y] );

        if( son[x][1] == y && dp2[x][1] != inf ){
            g[y][0] = dp2[x][1] + val[y];
        }else if( son[x][1] != y ){
            g[y][0] = dp1[x][1] + val[y];
        }
        if( g[x][1] != -inf )g[y][0] = min( g[y][0],g[x][1]+val[y] );
        dfs2(y,x);
    }
}
void init(int n){
    tot = 1;
    for(LL i = 0; i <= n; i++){
        he[i] = du[i] = son[i][0] = son[i][1] = 0;
        dp1[i][0] = dp2[i][0] = g[i][1] = -inf;
        dp1[i][1] = dp2[i][1] = g[i][0] = inf;
    }
}
LL A[maxn],B[maxn];
int main(){
    ios::sync_with_stdio(false);
    int T,n;
    cin>>T;
    while(T--){
        cin>>n;
        init(n);
        for(LL i = 1; i <= n; i++)cin>>A[i];
        for(LL i = 1; i <= n; i++)cin>>B[i];
        for(LL i = 1; i <= n; i++){
            val[i] = A[i] - B[i];
        }
        if(n == 1){
            cout<<val[1]<<endl;
            continue;
        }
        for(LL a, b, i = 1; i < n; i++){
            cin>>a>>b;
            add(a, b);
            add(b, a);
            du[a]++;du[b]++;
        }
        dfs(1, 0);
        dfs2(1, 0);
        LL ans = -inf;
        g[1][0] = g[1][1] = val[1];
        for(LL i = 1; i <= n; i++){
            if(i == 1)ans = max(ans, dp1[i][1]);
            else {
                if(du[i] > 1)ans = max(ans, min(dp1[i][1], g[i][1]));
                else ans = max(ans, g[i][1]);
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}