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 | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 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 |
---|