I need problems to practice segment trees. Can you guys suggest some good(little easy maybe) problems for me?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
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