https://en.algorithmica.org/hpc/data-structures/s-tree/
I announced this article a while ago but finally got to finish it just now.
Planned follow-ups: a 10-20x faster segment tree, std::priority_queue, and std::set.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | atcoder_official | 160 |
| 3 | maomao90 | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | Dominater069 | 155 |
| 8 | adamant | 154 |
| 9 | awoo | 152 |
| 9 | luogu_official | 152 |
→ Find user
→ Recent actions
A 15x faster std::lower_bound
Revision en1, by sslotin, 2022-02-17 22:53:31
History
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/28/2024 19:21:28 (j2).
Desktop version, switch to mobile version.
Supported by
