Accumulation Degree --- 换根dp

 个人感觉，换根dp的实质就是在不确定答案是以哪个节点为根时，先假设1个节点为根去遍历，更新答案，接着利用数学公式推出该假设根的子儿子为根的时候对应的值。

#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
int n;
const int N=400000+10;
long long e[N],ne[N],idx,h[N],edge[N];
bool vis[N];

long long dis[N];
long long deg[N];
long long f[N];
void add(int a,int b,long long  c)
{
    e[idx]=b,ne[idx]=h[a],edge[idx] = c,h[a]=idx++;
}

void dp(int x)
{
    vis[x] = 1;
    dis[x] = 0;
    for(int i = h[x] ; i != -1  ; i = ne[i])
    {
        int y = e[i];
        if(vis[y]) continue;
        dp(y);
        if(deg[y] == 1) dis[x] += edge[i];
        else dis[x] += min(edge[i],dis[y]);
        
    }
}
void dfs(int x)
{
    vis[x] = 1;
    for(int i = h[x] ; i != -1 ;i = ne[i])
    {
        int y = e[i];
        if(vis[y]) continue;
        if(deg[x] == 1) f[y] = dis[y] + edge[i];
        else if(deg[y] == 1 ) f[y] = dis[y] + min(f[x] - edge[i],edge[i]);
        else f[y] = dis[y] + min( f[x] - min(dis[y],edge[i]),edge[i]);
        dfs(y);
    }
}

int main() 
{
    std::ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--)
    {
      
        memset(f,0,sizeof f);
        memset(h,-1,sizeof h);
        memset(e,0,sizeof e);
        memset(ne,0,sizeof ne);
        memset(vis,0,sizeof vis);
        memset(deg,0,sizeof deg);
        memset(dis,0,sizeof dis);
        memset(edge,0,sizeof edge);
        idx = 0;
        cin >> n;
        long long x,y,z;
        for(int i = 1 ; i < n ; i++)
        {
            cin >> x >> y >> z;
            add(x,y,z);
            add(y,x,z);
            deg[x]++;
            deg[y]++;
        }
        int root = 1;
        dp(1);
        f[root] = dis[root];
        memset(vis,0,sizeof vis);
        dfs(root);
        long long ans = 0;
        for(int i = 1 ; i <= n ; i++) ans =max(ans,f[i]);
        cout << ans << endl;
    }

    return 0;
}