| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 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 |
how to solve this problem ?
Given a binary tree,where each node has value given x, (x>=0).
you need to find maximum sum of nodes's x value ,but you can not select two nodes in the answer such that one node is parent (only immediate),ans other is child.
like if 1 is root , and its left child is 2 and right child is 3 ,then you can not include 1 and 2, or 1 and 3 in the answer.
find maximum possible sum...
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
learner_321 | 2017-12-25 06:41:31 | 27 | Tiny change: 'ble sum...' -> 'ble sum...\n\nNumber of nodes<= (1e6)' | |
| en2 |
|
learner_321 | 2017-12-24 15:15:31 | 26 | ||
| en1 |
|
learner_321 | 2017-12-24 15:14:30 | 415 | Initial revision (published) |
