HDU 6201 transaction transaction transaction

Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book named "the Man Who Changed China". Of course, Kelukin wouldn't miss this chance to make money, but he doesn't have this book. So he has to choose two city to buy and sell. 
As we know, the price of this book was different in each city. It is aiai yuanyuan in iittcity. Kelukin will take taxi, whose price is 11yuanyuan per km and this fare cannot be ignored. 
There are n−1n−1 roads connecting nn cities. Kelukin can choose any city to start his travel. He want to know the maximum money he can get. 

Input

The first line contains an integer TT (1≤T≤101≤T≤10) , the number of test cases. 
For each test case: 
first line contains an integer nn (2≤n≤1000002≤n≤100000) means the number of cities; 
second line contains nn numbers, the iithth number means the prices in iithth city; (1≤Price≤10000)(1≤Price≤10000) 
then follows n−1n−1 lines, each contains three numbers xx, yy and zz which means there exists a road between xx and yy, the distance is zzkmkm (1≤z≤1000)(1≤z≤1000). 
Output

For each test case, output a single number in a line: the maximum money he can get. 

Sample Input

1  
4  
10 40 15 30  
1 2 30
1 3 2
3 4 10

Sample Output

8
题解：树形DP。这是让求从任意一点买书，然后到任意一点卖书，每条路都会耗费一定的费用，让求最多可挣多少钱。
我们可以吧任意一个节点当成根节点，然后树形DP，（就是DFS遍历），dp[x][1]代表以x为根节点的子树中中卖书
的最大值，dp[x][0]表示以x为根节点的子树中买书的最小费用。然后求dp[1~n][1]-dp[1~n][0]的最大值即可。

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
const int maxn=1e5+10;
int T,n,w[maxn],x,y,z,dp[maxn][2],Max,vis[maxn];
struct Edge{
    int v,w;
    Edge(int vv,int ww):v(vv),w(ww) { }
};
vector<Edge> vec[maxn]; 
void addedge(int u,int v,int w)
{
    vec[u].push_back(Edge(v,w));
}

void dfs(int s)
{
    vis[s]=1;
    for(int i=0;i<vec[s].size();i++) if(!vis[vec[s][i].v]) dfs(vec[s][i].v);
    for(int i=0;i<vec[s].size();i++)
    {
        dp[s][0]=min(dp[s][0],dp[vec[s][i].v][0]+vec[s][i].w);
        dp[s][1]=max(dp[s][1],dp[vec[s][i].v][1]-vec[s][i].w);
    }
}

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        memset(dp,0,sizeof dp);
        memset(vis,0,sizeof vis);
        scanf("%d",&n); 
        for(int i=1;i<=n;i++) vec[i].clear();
        for(int i=1;i<=n;i++) scanf("%d",w+i),dp[i][0]=dp[i][1]=w[i];
        for(int i=1;i<n;i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            addedge(x,y,z); addedge(y,x,z);
        }
        dfs(1); Max=0;
        for(int i=1;i<=n;i++) Max=max(Max,dp[i][1]-dp[i][0]);
        printf("%d\n",Max);
    }
    
    return 0;
 }