http://www.spoj.com/problems/HEAPULM/
how to solve this problem?? I tried a lot but i didn't get any idea how to solve this..
Thanks in Advance :)
№ | Пользователь | Рейтинг |
---|---|---|
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 | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
http://www.spoj.com/problems/HEAPULM/
how to solve this problem?? I tried a lot but i didn't get any idea how to solve this..
Thanks in Advance :)
Название |
---|
Umm, The problem just asks you to create a treap, which is a very standard data structure. Simple googling will provide you with a code and explanation.
http://www.geeksforgeeks.org/treap-set-2-implementation-of-search-insert-and-delete