any suggest to solve this problem using rmq(segment tree) http://mirror.codeforces.com/contest/71/problem/D
any suggest to solve this problem using rmq(segment tree) http://mirror.codeforces.com/contest/71/problem/D
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 161 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
I remembered that I solved this problem in a very straightforward manner, with quite long codes. Well, it is a little difficult for me to relate this problem with RMQ....
it may need 2d segment tree
Now I understand why I can not establish the relationship between segment tree and that problem....
If you figure out how to solve it based on 2D segment tree, it is really nice for you to share some materials or discussion about it. I think 2D segment tree is really an advanced technique, at least for me.