HDU - 2376 Average distance（树形dp）

题目链接：点击这里

题目大意：
给定一棵树，和任意相邻两点之间的距离，求任意两点距离的平均值

题目分析：
树形dp
我们可以先将问题转化为求树上任意两点距离的和，然后除以 $C_n^2=\frac{n(n-1)}{2}$ 来得到答案
定义状态 $dp[i]$ 表示以 $i$ 为根的子树的任意两点距离的和
其转移方程为 $dp[i]={\sum }_{j\in so{n}_i}dp[j]+siz[j]\cdot (n-siz[j])\cdot val$ ，相当于对每一条边考虑其贡献，其贡献为边两端的子树大小的乘积再乘上自己的边权

具体细节见代码：

//#pragma GCC optimize(2)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define ll long long
#define inf 0x3f3f3f3f
#define int  ll
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int read()
{
	int res = 0,flag = 1;
	char ch = getchar();
	while(ch<'0' || ch>'9')
	{
		if(ch == '-') flag = -1;
		ch = getchar();
	}
	while(ch>='0' && ch<='9')
	{
		res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
		ch = getchar();
	}
	return res*flag;
}
const int maxn = 1e4+5;
const int mod = 998244353;
const double pi = acos(-1);
const double eps = 1e-8;
int n,siz[maxn],dp[maxn];
vector<pair<int,int>>g[maxn];
void dfs(int u,int fa)
{
	dp[u] = 0; siz[u] = 1;
	for(auto p:g[u])
	{
		int to = p.first,val = p.second;
		if(to == fa) continue;
		dfs(to,u);
		siz[u] += siz[to];
		dp[u] += dp[to]+siz[to]*(n-siz[to])*val;
	}
}
signed main()
{
	int t = read();
	while(t--)
	{
		n = read();
		for(int i = 0;i < n;i++) g[i].clear();
		for(int i = 1;i < n;i++)
		{
			int u = read(),v = read(),val = read();
			g[u].push_back({v,val});
			g[v].push_back({u,val});
		}
		dfs(0,0);
		printf("%.10f\n",2.0*dp[0]/n/(n-1));
	}
	return 0;
}