In a rooted tree $$$T$$$, let $$$dep_u$$$ be the distance from $$$u$$$ to the root, $$$dis_u$$$ be the distance from $$$u$$$ to the deepest leaf in $$$u$$$'s subtree.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
How to analyze this expected value of a random tree?
In a rooted tree $$$T$$$, let $$$dep_u$$$ be the distance from $$$u$$$ to the root, $$$dis_u$$$ be the distance from $$$u$$$ to the deepest leaf in $$$u$$$'s subtree.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | Y25t | 2021-09-30 12:18:42 | 0 | (published) | ||
en3 | Y25t | 2021-09-30 12:13:56 | 1 | Tiny change: 'ooted tree.\n\nHow t' -> 'ooted trees.\n\nHow t' (saved to drafts) | ||
en2 | Y25t | 2021-09-30 10:51:01 | 216 | Tiny change: 's subtree.' -> 's subtree.\nLet $f(T)=\sum_{u\in T} dep_u\times dis_u$, ' (published) | ||
en1 | Y25t | 2021-09-30 10:26:42 | 194 | Initial revision (saved to drafts) |
Name |
---|