Codeforces 101D

树形dp，关于sort那里，
假如u的两个子树v1,v2相继访问，那么优先访问谁
假如此时已经过去时间t，假如先访问v1:
dp[v]访问v树的最优花费，son[v]v树的节点个数，sumv*2
fv1=(t+(u,v1))*son[v1]+dp[v1]
fv2=(t+sum[v1]+(u,v2))*son[v2]+dp[v2];

假如先访问v2:
f1v2=(t+(u,v2))*son[v2]+dp[v2];
f1v1=(t+sum[v2]+(u,v1))*son[v1]+dp[v1];

比较fv1+fv2

#include <bits/stdc++.h>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

const int MAXN = 500000;
//const int MOD = 1e9+7;
//const int INF = 0x3f3f3f3f;
int n;
vector<int> G[MAXN], W[MAXN];
LL dp[MAXN], dsum[MAXN], son[MAXN];
int indice[MAXN];

bool cmp(int u, int v) {
    return dsum[u]*son[v] < dsum[v]*son[u];
}

void dfs(int u, int fa) {
    dsum[u] = dp[u] = son[u] = 0;
    int cnt = 0;
    for (int i = 0; i < G[u].size(); i++) {
        int v = G[u][i];
        if (v == fa) continue;
        dfs(v, u);
        dsum[v] += 2*W[u][i];
        dsum[u] += dsum[v];
        dp[v] += son[v] * W[u][i];
        dp[u] += dp[v];
        son[u] += son[v];
    }
    for (int i = 0; i < G[u].size(); i++)
        if (G[u][i] == fa)
            continue;
        else
            indice[++cnt] = G[u][i];
    sort(indice+1, indice+cnt+1, cmp);
    int s = son[u];
    for (int i = 1; i <= cnt; i++) {
        //if (u == 1) cout << indice[i] << endl;
        s -= son[indice[i]];
        dp[u] += s*dsum[indice[i]];
    }
    son[u] += 1;
}

int main()
{
    //freopen("input.txt", "r", stdin);
    scanf("%d", &n);
    for (int i = 1; i < n; i++) {
        int u, v, d;
        scanf("%d%d%d", &u, &v, &d);
        G[u].push_back(v);
        G[v].push_back(u);
        W[u].push_back(d);
        W[v].push_back(d);
    }
    dfs(1, 0);
    //cout << dp[2] << " " << dp[4] << endl;
    printf("%.12f", (double)dp[1]/(n-1));
    return 0;
}