Advertisement blocking software were detected ;( Please add this webpage to whitelist.
ORDERSET  Order statistic set
Added by:  Duc 
Date:  20081028 
Time limit:  0.300s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: ERL JS NODEJS PERL 6 VB.net 
Resource:  © VNOI 
hide comments
anando_du:
20150723 21:45:44
^_^ finally got AC ^_^ rank #3 ^_^ 

xxbloodysantaxx:
20150721 23:31:16
For K type of queries O (Log N ^ 2 ) else wise O (Log N) and I used encoding . BIT <3 is simply fast and unstoppable 

Ayush Mishra:
20150719 04:56:51
Finally accepted using treap! 

i_am_looser:
20150528 13:09:25
Finally AC..... ;)


Koderok:
20150421 10:37:40
Sometimes, even C++ STL containers are not fast enough! 

m0hamed:
20150416 04:51:51
I think the time limit is too strict to pass even efficient solutions. Can you recheck the time limit? 

albertg:
20150327 11:52:32
time limit is too strict


(Tjandra Satria Gunawan)(Ã¦â€ºÂ¾Ã¦Â¯â€¦Ã¦Ëœâ€ ):
20150114 06:06:42
For people who solve this problem with time <2.50s, I recommend you to try SID problem too :) 

aristofanis:
20150114 06:06:42
The nicest problem I have solved in this site! 

Alexander Urieles:
20150114 06:06:42
A great problem. Last edit: 20090523 22:31:40 