Puzzles (树形dp+组合数学)

Barney lives in country USC (United States of Charzeh). USC has n cities numbered from 1 through n and n - 1 roads between them. Cities and roads of USC form a rooted tree (Barney’s not sure why it is rooted). Root of the tree is the city number 1. Thus if one will start his journey from city 1, he can visit any city he wants by following roads.

Some girl has stolen Barney’s heart, and Barney wants to find her. He starts looking for in the root of the tree and (since he is Barney Stinson not a random guy), he uses a random DFS to search in the cities. A pseudo code of this algorithm is as follows:

let starting_time be an array of length n
current_time = 0
dfs(v):
current_time = current_time + 1
starting_time[v] = current_time
shuffle children[v] randomly (each permutation with equal possibility)
// children[v] is vector of children cities of city v
for u in children[v]:
dfs(u)
As told before, Barney will start his journey in the root of the tree (equivalent to call dfs(1)).

Now Barney needs to pack a backpack and so he wants to know more about his upcoming journey: for every city i, Barney wants to know the expected value of starting_time[i]. He’s a friend of Jon Snow and knows nothing, that’s why he asked for your help.

Input
The first line of input contains a single integer n (1 ≤ n ≤ 105) — the number of cities in USC.

The second line contains n - 1 integers p2, p3, …, pn (1 ≤ pi < i), where pi is the number of the parent city of city number i in the tree, meaning there is a road between cities numbered pi and i in USC.

Output
In the first and only line of output print n numbers, where i-th number is the expected value of starting_time[i].

Your answer for each city will be considered correct if its absolute or relative error does not exceed 10 - 6.

做法：设tree[x]表示以x为根的子树的节点总数
fx是x的直接根节点

dp[i]表示i的期望时间
设n表示fx的直接子节点数
总共有n!的排列个数
对于x在i位，对于 j 就有C(i-1,1)*(n-2)!种方式排列在x前面
然后j排列在x前面的总方法就有∑C(i-1,1)*(n-2)!=n!/2
由于对每个j都有这个式子，遍历的时候是先遍历以j为根的子树再到x的
则可以推出 dp[x]=dp[fx]+1+(tree[fx]-tree[x]-1)/2

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#define maxn 100010
using namespace std;
int d[maxn];
int n;
vector<int> f[maxn];
int head[maxn];
int tree[maxn];
double dp[maxn];
struct Node
{
    int to,next;
}e[maxn];
int cnt;
void add(int a,int b)
{
    e[cnt].to=b;
    e[cnt].next=head[a];
    head[a]=cnt++;
}
void init()
{
    cnt=0;
    memset(tree,0,sizeof(tree));
    memset(dp,0,sizeof(dp));
    memset(head,-1,sizeof(head));
    for(int i=1;i<=n;i++)f[i].clear();
}
void getnum(int x,int fx)
{
    tree[x]=1;
    for(int i=0;i<f[x].size();i++)
    {
        int cur=f[x][i];
        if(cur==fx)continue;
        getnum(cur,x);
        tree[x]+=tree[cur];
    }
}
void dfs(int x,int fx)
{
    dp[x]=dp[fx]+1.0;
    dp[x]=dp[x]+(tree[fx]-tree[x]-1)*1.0/2.0;
    for(int i=0;i<f[x].size();i++)
    {
        int cur = f[x][i];
        if(cur==fx)continue;
        dfs(cur,x);
    }
}

void solve()
{
    getnum(0,-1);
    dfs(1,0);
    for(int i=1;i<=n;i++)
    {
        printf("%lf ",dp[i]);
    }
    printf("\n");
}
int main()
{
    while(scanf("%d",&n)==1)
    {
        init();
        int a,b;
        for(int i=2;i<=n;i++)
        {
            scanf("%d",&a);
            f[a].push_back(i);
        }
        f[0].push_back(1);
        solve();
    }
    return 0;
}