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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.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: