C. Parsa‘s Humongous Tree（树形dp）

http://codeforces.com/contest/1529/problem/C

题意：每个点给一个可以选的范围，俩个点的边权是俩个点相减的绝对值，
问能够形成的这个树的边权和最大是多少。

题解：树形DP

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define PII pair<int, int>
#define mpr make_pair
#define ms(a, b) memset((a), (b), sizeof(a))
#define x first
#define y second
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 7;
using namespace std;
int n;
int f[N][2], l[N], r[N];
vector<int> ma[N];

void dfs(int u,int old){
    int len=ma[u].size();
    for(int i=0;i<len;i++){
        int v=ma[u][i];
        if(v==old)continue;  //不能回去
        dfs(v,u);
        f[u][0]+=max(f[v][0]+abs(l[u]-l[v]),f[v][1]+abs(l[u]-r[v]));//本点选小端点，看下一个点选小的或者选大的哪个是我最终答案大
        f[u][1]+=max(f[v][0]+abs(r[u]-l[v]),f[v][1]+abs(r[u]-r[v]));//本点选大端点，
    } 
}
signed main(int argc, char const *argv[]) {
    int T;
    scanf("%lld", &T);
    while (T--) {
        scanf("%lld", &n);
        for (int i = 1; i <= n; i++) {
            scanf("%lld%lld", &l[i], &r[i]);
            ma[i].clear();
        }
        for (int i = 1; i < n; i++) {
            int u, v;
            scanf("%lld%lld", &u, &v);
            ma[u].emplace_back(v);
            ma[v].emplace_back(u);
        }
        dfs(1, 0);
        printf("%lld\n", max(f[1][0], f[1][1]));
        for (int i = 1; i <= n; i++) f[i][0] = f[i][1] = 0;
    }
    return 0;
}