[HDU3899]JLUCPC

Time Limit: 15000/5000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)

Problem Description
Dr. Skywind and Dr. Walkoncloud are planning to hold the annual JLU Collegiate Programming Contest. The contest was always held in the college of software in the past. However, they changed their minds and decided to find the most convenient location from all colleges this year.
Each college in JLU is located in one of the $N(1<=N<=100,000)$ different locations (labeled as $1$ to $N$) connected by $N-1$ roads. Any two colleges are reachable to each other. The Contest can be held at any one of these N colleges. Moreover, Road i connects college $A_i$ and $B_i$ $(1<=A_i<=N;1<=B_i<=N)$ and has length $L_i(1<=L_i<=1,000)$. College $i$ has $T_i(0<=T_i<=1,000)$ teams participating in the contest.
When choosing the college to hold the Contest, Dr. Skywind wishes to minimize the inconvenience of the chosen location. The inconvenience of choosing college $P$ is the sum of the distance that all teams need to reach college $P$ (i.e., if the distance from college $i$ to college $P$ is $20$, then the travel distance is $T_i$*$20$). Please help Dr. Skywind and Dr. Walkoncloud to choose the most convenient location for the contest.

Input
There are multiple test cases. For each case, the first line contains a single integer $N$, indicating the number of colleges. The next $N$ lines describes $T_1$ to $T_n$. Then, each of the last $N-1$ lines will contain $3$ integers, namely $A_i$, $B_i$ and $L_i$.

Output
For each case, output the minimum inconvenience possible

Sample Input

3
1
1
2
1 2 2
2 3 1
4
100
1
1
1
1 2 1
2 3 1
2 4 1

Sample Output

4
5

Source
2011 Multi-University Training Contest 6 - Host by JLU

题意：
有$n$个学校要举办比赛，这$n$所学校之间的路径构成一棵树，第$i$个学校派出$T[i]$个队，求选定一个学校作为比赛举办地点，使得$\sum (T[i]\ast dis[i])$最小，$dis[i]$为第$i$所学校到比赛举办地点的距离。

题解：
两次dfs
我们先假设学校1为举办地点，求出答案，设$ecp[i]$为如果$i$点是举办地点，以$i$为根节点的子树的答案是多少；设$sz[i]$为以$i$为根节点的子树的队伍的数量。很显然$ecp[1]$就是以$1$为举办地点所对应的答案。考虑答案向子树转移的代价，如果举办地点从$a$转移到与$a$相邻的$b$，设在$a$的时候答案是$ans$，那么到b的时候答案就是$ans-sz[b]\ast w(a,b)+(sum-sz[b])\ast w(a,b)$，$w(a,b)$为$(a,b)$这条边的长度，$sum$表示所有参赛队伍的数量。$b$点所在子树的所有队伍都可以不用走$(a,b)$这条边了，所以减去$sz[b]\ast w(a,b)$，所有除了$b$子树上的队伍都要走$(a,b)$这条边，所以答案加上$(sum-sz[b])\ast w(a,b)$，化简一下式子就是$ans+(sum-2\ast sz[b])\ast w(a,b)$
第一遍dfs求ecp，然后第二遍求最小的ans就行了。可能会炸int，所以请用long long

#include<bits/stdc++.h>
#define LiangJiaJun main
#define ll long long
using namespace std;
int a[100004],n;
int ne,h[100004];
ll ecp[100004],sz[100004],ans,sum;
bool vis[100004];
struct edge{
    int to,nt,w;
}e[400004];
void add(int u,int v,int w){
     e[++ne].to=v;e[ne].w=w;e[ne].nt=h[u];
     h[u]=ne;
}
void dfs(int x){
     vis[x]=1;
     sz[x]=a[x];
     ecp[x]=0;
     for(int i=h[x];i;i=e[i].nt){
         if(vis[e[i].to])continue;
         dfs(e[i].to);
         sz[x]+=sz[e[i].to];
         ecp[x]+=ecp[e[i].to]+sz[e[i].to]*e[i].w;
     }
}
void calc(int x,ll val){
     ans=min(ans,val);
     vis[x]=1;
     for(int i=h[x];i;i=e[i].nt){
        if(vis[e[i].to])continue;
        ll nxt_val=val+(sum-2LL*sz[e[i].to])*e[i].w;
        calc(e[i].to,nxt_val);
     }
}
int w33ha(){
    ne=0;
    memset(h,0,sizeof(h));
    for(int i=1;i<=n;i++)vis[i]=0;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<n;i++){
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        add(u,v,w);
        add(v,u,w);
    }
    dfs(1);
    ans=ecp[1];
    sum=sz[1];
    for(int i=1;i<=n;i++)vis[i]=0;
    calc(1,ans);
    printf("%lld\n",ans);
    return 0;
}
int LiangJiaJun(){
    while(scanf("%d",&n)!=EOF)w33ha();
    return 0;
}