| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Hi everyone , I have a question which i faced a lot while implementing a problem and i usually handled it with segment tree but i think it must have an easier way
think that u have a set s
i want to find out number x position in this set
more formally i want s.find(x) — s.begin()
but c++ set can't handle this ! what should i do ? is there any way without using other structures to solve this ?
Auto comment: topic has been updated by _Ramtin_ (previous revision, new revision, compare).
http://stackoverflow.com/questions/13505562/getting-index-of-set-element-via-iterator
oh thanks man !
Be aware that
distancefunction wouldn't be constant-time while givenbidirectional iterators.If there are many such 'queries', then transform std::set into a vector. Vector supports upper_bound/lower_bound functions and by subtracting v.begin() you can get the index.
nope i needed an online sorted array for those problems and vector couldn't do that :)
Then you will have to write your own treap. I assume that distance works in linear time and is almost completely useless in your case.
There are ways to use g++ order statistic tree if you really need it.
read this http://codeforces.net/blog/entry/11080
Your Big Problem is your little penis!