According to Wikipedia, an RMQ can be built with O(n) memory (O(n) precomp) that can answer queries in O(1).
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 156 |
| 6 | Qingyu | 155 |
| 7 | djm03178 | 152 |
| 7 | adamant | 152 |
| 9 | luogu_official | 150 |
| 10 | awoo | 147 |
→ Find user
→ Recent actions
Enumerating all Binary Trees to build O(n)/O(1) RMQ
Revision en2, by SecondThread, 2019-11-24 20:45:24
History
Revisions
| 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) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/22/2025 16:00:39 (k3).
Desktop version, switch to mobile version.
Supported by
