| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | cry | 160 |
| 2 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | atcoder_official | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 149 |
How can I approach this problem using optimal binary search tree?
Here is what I've been trying so far: 1) finding heights of each node 2) using those heights as frequencies and creating a OBST 3) printing the depth of each node on that OBST as result.
This is giving me WA. I can't find any other way. So I'd really appreciate any help.
Thank you.
Comments (0)
