Hi everyone , I am searching for problems that require a 2D segment tree ( if it's possible , i want them in an increasing order )... thanks in advance :)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 4 | Um_nik | 144 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
searching for 2D segment tree problems
Hi everyone , I am searching for problems that require a 2D segment tree ( if it's possible , i want them in an increasing order )... thanks in advance :)
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| 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) |
| Название |
|---|


