P2986 [USACO10MAR] Great Cow Gathering G (学学换根dp)

题目
题意: 给定n个点的树，每个点有对应的点权。选中一个点，满足所有点到其的点权*距离之和最小，输出对应的最小值。
思路: 还是最基础的换根dp，只不过和上一个题相比多了边权和点权，注意边权不是1就行。
时间复杂度: O(n)
代码:

// Problem: P2986 [USACO10MAR] Great Cow Gathering G
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P2986
// Memory Limit: 128 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
#define int long long 
int a[N];
int h[N],e[N<<1],ne[N<<1],w[N<<1],idx = 0;
void add(int a,int b,int c)
{
	e[idx] = b,w[idx] = c,ne[idx] = h[a],h[a] = idx++;
}
int f[N]; //以i为根的答案
int g[N]; //以i为根的 s{a[i]}
int d[N]; //深度
void dfs1(int u,int fa)
{
	g[u] = a[u];
	for(int i=h[u];~i;i=ne[i])
	{
		int j = e[i];
		if(j == fa) continue;
		d[j] = d[u] + 1;
		dfs1(j,u);
		g[u] += g[j];
		f[u] += g[j]*w[i] + f[j];
		// cout<<u<<" "<<j<<":"<<d[j]<<" "<<a[j]<<"\n";
	}
}
int sum = 0;
void dfs2(int u,int fa)
{
	for(int i=h[u];~i;i=ne[i])
	{
		int j = e[i];
		if(j == fa) continue;
		f[j] = f[u] + w[i] * (sum - 2*g[j]);
		dfs2(j,u);
	}
}
void solve()
{
   read(n); mem(h,-1);
   for(int i=1;i<=n;++i) read(a[i]),sum += a[i];
   for(int i=0;i<n-1;++i)
   {
   	  int x,y,z; read(x),read(y),read(z);
   	  add(x,y,z),add(y,x,z);
   }
   dfs1(1,0);
   int ans = f[1];
   dfs2(1,0);
   for(int i=2;i<=n;++i) ans = min(ans,f[i]);
   // fir(i,1,n) cout<<i<<":"<<f[i]<<endl;
   write(ans);
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}