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 ?
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 ?
