I need problems to practice segment trees. Can you guys suggest some good(little easy maybe) problems for me?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
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.net/gym/100093
http://codeforces.net/gym/100094