| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | pajenegod | 145 |
| 9 | Petr | 145 |
This problem I meet very often: there is a set, in which we can add element, also we can erase any element. The problem is to count the number of elements less then x.
Sure, the problem can be solved with treap or something like that, but can it be solved with std::set or other already released data structures?
Any ideas?
It can be solved with C++ SGI STL tree. link
STL policy based data structures: order_of_key() is what you're looking for.
you too can use sqrt descomposition — mipt item 4.
Actually, if the problem allows that you can doing this work offline, you can easily solve it by using Binary Indexed Tree and Hashing:)
yes! you too can use online segment tree on air! (update and query in [1, maxElement]). O(q logmaxElement). This can be implemented without pointers!
If Max Element is too big to store in an array:
1- Online: You can use dynamic segment tree or any variation of it.
2- Offline: You can use index compression with regular BIT.
sure. :)