Hi everyone , I am searching for problems that require a 2D segment tree / BIT or quad tree ( if it's possible , i want them in an increasing order of difficulty )... thanks in advance :)
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
rayenhaf | 2016-07-06 02:20:19 | 19 | Tiny change: 'ment tree ( if' -> 'ment tree / BIT or quad tree ( if' | |
| en2 |
|
rayenhaf | 2016-07-05 03:19:36 | 14 | Tiny change: 'ing order )...\ntha' -> 'ing order of difficulty )...\ntha' | |
| en1 |
|
rayenhaf | 2016-07-05 01:49:31 | 193 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/26/2026 19:46:18 (g2).
Desktop version, switch to mobile version.
Supported by
