XDU 1164 男神的树(树+lazy数组)

#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#define N (int)(1e7+5)
using namespace std;
int fa[N],va[N],lazy[N];
bool vis[N];
int n,u,v;
long long sum;
long long dfs(int i)
{
    if(vis[i])
        return ;
    vis[i]=;
    if(fa[i]==){
        lazy[i]+=va[i];
        return abs(lazy[i]);
    }
    long long s=;
    va[i]-=lazy[fa[i]];
    lazy[i]+=(lazy[fa[i]]+va[i]);
    s+=abs(va[i]);
    return s;
}
int main()
{
    scanf("%d",&n);
    for(int i=;i<n-;++i){
        scanf("%d%d",&u,&v);
        fa[v]=u;
    }
    for(int i=;i<=n;++i)
        scanf("%d",&va[i]);
    for(int i=;i<=n;++i)
        sum+=dfs(i);
    printf("%lld\n",sum);
}