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 ?
Hey guys i need help for solving this problem :
my idea was it's better to choose leaves of the tree because if there is a way that is the best and a node is chosen that is not a leave u can continue your way from this node down to the leave and the answer wont decrease
so i put a counter on bad edges and when ever i reached a leaf and the counter is not zero i add the leave to answer
my submission : http://codeforces.com/contest/369/submission/12994706
i dont know what is wrong with this please help !