ssavi's blog

How to Implement this DS [ order_of_key ]
By ssavi, history, 9 years ago, In English

Hello All.

Please watch this Data Structure :

order_of_key

Today I found this STL from this solution ( 15th Line from the Last Line ) : http://codeforces.me/contest/658/submission/16995396
of Problem B [ VK CUP DIV2 ] .

Later when I have goggled about it I found a Blog written by adamant about this Topic . Here is the Link : http://codeforces.me/blog/entry/11080

But I am failed to understand the actual Purpose & the vast application of this STL . Undoubtedly its a Great Blog & Technique . And with due respect I Thank him .

Now here is My Queries :

What STLs are used ? Why they are used ? How they should be used ? In which Problems I can use this DS ? Are there any special requirments to implement those ?

Thanks in Advance . It would be great help .

  • Vote: I like it
  • -12
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Learning to speak... STL is Standard Template Library. tree is data structure, which has method order_of_key.

tree is very similar to set/map, doing almost the same things. But tree has methods order_of_key and find_by_order, which is very useful. It has some other advantages, google more about it. On practice it works a little bit slower than set\map, but not much, so if time isn't really critical this data structure will look great in your program replacing loads of code lines with few method calls.

→ Reply