Hello codeforces! I'm practicing an exercise. My idea is to get the position of the selected element after a binary search on a set. Can you guys help me?..
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Hello codeforces! I'm practicing an exercise. My idea is to get the position of the selected element after a binary search on a set. Can you guys help me?..
Name |
---|
Ordered set
what's that. Can you explain more for me. Thank you btw:3
Just google it. It's a policy based data structure that allows you to do exactly that. Normal
std::set
s only store the relative location to their back and front elements, (loosely analagous to a linked list), so it's not possible to get the position.Hello! Are you from Ukraine? I think I've seen the name Maksym Shvedchenko several times.
Yes
thanks XD
So what about evaluating time complexity?
$$$O(logN)$$$
Souce 1 — Ordered set
Source 2 — Blog