Enumerating all Binary Trees to build O(n)/O(1) RMQ

Revision en5, by SecondThread, 2019-11-24 20:49:19

According to Wikipedia, an RMQ can be built with $$$O(n)$$$ memory ($$$O(n)$$$ precomp) that can answer queries in O(1).

Tags range minimum query, 4-russians

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en9 English SecondThread 2019-11-24 21:14:02 0 (published)
en8 English SecondThread 2019-11-24 21:13:06 18 Tiny change: 'lockSize^2)$.\n\nBut' -> 'lockSize^2 * nCartesianTrees)$.\n\nBut'
en7 English SecondThread 2019-11-24 21:11:49 149
en6 English SecondThread 2019-11-24 21:08:55 1011
en5 English SecondThread 2019-11-24 20:49:19 8
en4 English SecondThread 2019-11-24 20:47:34 2 Tiny change: 'ilt with _O(n)_ memory (' -> 'ilt with __O(n)__ memory ('
en3 English SecondThread 2019-11-24 20:47:26 4 Tiny change: 'uilt with `O(n)` memory (O' -> 'uilt with _O(n)_ memory (O'
en2 English SecondThread 2019-11-24 20:45:24 3 Tiny change: 'uilt with O(n) memory (O' -> 'uilt with `O(n)` memory (O'
en1 English SecondThread 2019-11-24 20:44:50 161 Initial revision (saved to drafts)