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 | Benq | 3783 |
2 | jiangly | 3772 |
3 | tourist | 3706 |
4 | maroonrk | 3609 |
5 | Um_nik | 3591 |
6 | fantasy | 3526 |
7 | ko_osaga | 3500 |
8 | inaFSTream | 3477 |
9 | cnnfls_csy | 3427 |
10 | zh0ukangyang | 3423 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 185 |
2 | awoo | 182 |
3 | nor | 172 |
4 | -is-this-fft- | 170 |
5 | adamant | 169 |
6 | maroonrk | 165 |
7 | antontrygubO_o | 160 |
8 | SecondThread | 158 |
9 | dario2994 | 152 |
10 | kostka | 151 |
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: