According to Wikipedia, an RMQ can be built with $$$O(n)$$$ memory ($$$O(n)$$$ precomp) that can answer queries in O(1).
Enumerating all Binary Trees to build O(n)/O(1) RMQ
According to Wikipedia, an RMQ can be built with $$$O(n)$$$ memory ($$$O(n)$$$ precomp) that can answer queries in O(1).
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en9 |
![]() |
SecondThread | 2019-11-24 21:14:02 | 0 | (published) | |
en8 |
![]() |
SecondThread | 2019-11-24 21:13:06 | 18 | Tiny change: 'lockSize^2)$.\n\nBut' -> 'lockSize^2 * nCartesianTrees)$.\n\nBut' | |
en7 |
![]() |
SecondThread | 2019-11-24 21:11:49 | 149 | ||
en6 |
![]() |
SecondThread | 2019-11-24 21:08:55 | 1011 | ||
en5 |
![]() |
SecondThread | 2019-11-24 20:49:19 | 8 | ||
en4 |
![]() |
SecondThread | 2019-11-24 20:47:34 | 2 | Tiny change: 'ilt with _O(n)_ memory (' -> 'ilt with __O(n)__ memory (' | |
en3 |
![]() |
SecondThread | 2019-11-24 20:47:26 | 4 | Tiny change: 'uilt with `O(n)` memory (O' -> 'uilt with _O(n)_ memory (O' | |
en2 |
![]() |
SecondThread | 2019-11-24 20:45:24 | 3 | Tiny change: 'uilt with O(n) memory (O' -> 'uilt with `O(n)` memory (O' | |
en1 |
![]() |
SecondThread | 2019-11-24 20:44:50 | 161 | Initial revision (saved to drafts) |