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) |
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
