| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Maximum Path sum in tree
You are given a tree with N nodes numbered 1 to N. Each node is having weight Ai. (1 <= i <= N)
Find the maximum path sum between any two node u and v of the tree. Return the maximum path sum value. constraints:
1 <= T <= 10 1 <= N <= 1e4 -1e6 <= Ai <= +1e6
Example:
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en3 |
|
vrkorat211 | 2020-08-23 11:48:59 | 14 | Tiny change: 'e coding competition on 22nd A' -> 'e coding challenge on 22nd A' | |
| en2 |
|
vrkorat211 | 2020-08-23 11:47:58 | 16 | ||
| en1 |
|
vrkorat211 | 2020-08-23 11:46:18 | 781 | Initial revision (published) |
