地址:http://oj.acmclub.cn/problems/2014
思路:树状dp
Code:
#include<iostream>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int,int> pr;
const int MAX_N=5e5+5;
int n,m,T;
LL res,Sum_w;
int S[MAX_N];
LL d[MAX_N],W[MAX_N];
LL Wi[MAX_N];
vector<pr> e[MAX_N];
void DFS(int u,int pre);
void DFS1(int u,int pre,LL Sum);
int main()
{
ios::sync_with_stdio(false);
cin>>n;
int u,v,w;
for(int i=1;i<n;++i)
{
cin>>u>>v>>w;
e[u].push_back({v,w});
e[v].push_back({u,w});
}
for(int i=1;i<=n;++i)
{
cin>>W[i];
Sum_w+=W[i];
}
DFS(1,0);
for(int i=1;i<=n;++i)
res+=d[i]*W[i];
DFS1(1,0,res);
cout<<res<<endl;
return 0;
}
void DFS(int u,int pre)
{
Wi[u]=W[u]; S[u]=1;
int v,w;
for(auto c:e[u])
if(c.first!=pre){
v=c.first; w=c.second;
d[v]=d[u]+w;
DFS(v,u);
Wi[u]+=Wi[v];
S[u]+=S[v];
}
}
void DFS1(int u,int pre,LL Sum)
{
int v,w;
LL Sv;
for(auto c:e[u])
if(c.first!=pre){
v=c.first; w=c.second;
Sv=Sum-w*Wi[v]+w*(Sum_w-Wi[v]);
res=min(res,Sv);
DFS1(v,u,Sv);
}
}