【题目链接】http://www.lydsy.com/JudgeOnline/problem.php?id=2435
【解题思路】树上DP(DFS用内嵌汇编手动开大系统栈或者写BFS)
【呆马】
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<iostream>
const int N=1e6+1;
using namespace std;
struct st{int to,next;long long v;} e[N<<1];
int n,i,x,y,cnt,he,ta,fi[N],b[N],fa[N];
long long z,ans,siz[N];
void add(int x,int y,long long z)
{
e[++cnt].to=y; e[cnt].next=fi[x]; e[cnt].v=z; fi[x]=cnt;
e[++cnt].to=x; e[cnt].next=fi[y]; e[cnt].v=z; fi[y]=cnt;
}
int main()
{
scanf("%d\n",&n);
for (i=1;i<n;i++)
{
scanf("%d%d%lld\n",&x,&y,&z);
add(x,y,z);
}
for (b[he=ta=1]=1;he<=ta;he++)
{
siz[x=b[he]]=1;
for (int i=fi[x];i;i=e[i].next)
if (e[i].to!=fa[x]) fa[b[++ta]=e[i].to]=x;
}
for (;ta;ta--)
{
x=b[ta];
for (int i=fi[x];i;i=e[i].next)
if (e[i].to!=fa[x]) siz[x]+=siz[e[i].to],ans+=e[i].v*abs((siz[e[i].to]<<1)-n);
}
printf("%lld",ans);
}