I need problems to practice segment trees. Can you guys suggest some good(little easy maybe) problems for me?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I need problems to practice segment trees. Can you guys suggest some good(little easy maybe) problems for me?
Name |
---|
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.com/gym/100093
http://codeforces.com/gym/100094