According to Wikipedia, an RMQ can be built with $$$O(n)$$$ memory ($$$O(n)$$$ precomp) that can answer queries in O(1).
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
2 | awoo | 163 |
4 | TheScrasse | 154 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | pajenegod | 144 |
9 | orz | 144 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|