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 | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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://mirror.codeforces.com/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: