I need problems to practice segment trees. Can you guys suggest some good(little easy maybe) problems for me?
I need problems to practice segment trees. Can you guys suggest some good(little easy maybe) problems for me?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 142 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
here spoj problems
ANDROUND
BRCKTS
DQUERY
FREQUENT
GSS3 << easy
HEAPULM
HELPR2D2
KGSS
MKTHNUM
NICEDAY
YODANESS
And the GSSs.
EDIT:: You can also try Light OJ. They've got some really cool segment tree problems too.
GSSs ?
Spoj GSS1 — Spoj GSS5.
But GSS1 about RMSQ
it can be solved by segment tree,here you can get a nice tutorial about maximum sub-segment sum. http://e-maxx.ru/algo/segment_tree
Timus 1846
http://codeforces.me/gym/100093
http://codeforces.me/gym/100094