Hello!
Given a binary tree, find a** maximum path for each node**.
Hope to get an optimal solution Input- N=6
edges= 1->2,2->3,1->4,4->5,4->6
output= 2 3 4 3 4 4
Thanks in advance!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
4 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
Hello!
Given a binary tree, find a** maximum path for each node**.
Hope to get an optimal solution Input- N=6
edges= 1->2,2->3,1->4,4->5,4->6
output= 2 3 4 3 4 4
Thanks in advance!
Название |
---|
You can solve this problem using DP on trees, check this tutorial
solition in O(n log n)
lets find the answer for node V. V has O(logN) nodes in path from V to root. Let U — node in this path. then also let's find for each V max_d[V] — max len from V to some node in subtree of V.
let's try to update the answer for V. there's a exactly one son of U, who is in the path from V to root, let it be Z. then there's the algorithm to find the ans for V, if U is known.
i think it's pretty obvious why it works. so then whole alg is this: