| # | User | Rating |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
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. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| 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) |
