hello everybody. I currently learned the segment tree algorithm and it is a bit diffucult to understand this. I really need help to provide better understand and implementation . What would you advise for me to get this ? thank u
# | 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 | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
hello everybody. I currently learned the segment tree algorithm and it is a bit diffucult to understand this. I really need help to provide better understand and implementation . What would you advise for me to get this ? thank u
Name |
---|
Segment Tree I learned from this. The code is simple if u do reverse engg.
You can practice on Codeforces, LightOJ...
For example, you can try to solve http://codeforces.net/problemset/problem/381/E
I finally solved that problem. And it was really helpful. Thank you.
thanks for your ideas.
Here are some helpful posts:
These posts describe lazy propagation, a very useful technique: