Hi everybody!
I am solving problem that need addition on a segment and getting sum and minimum on a segment. I have some problem with lazy propagation.
Can you share your code with Segment tree. Preferably recursively)
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Addition on a segment(Segment tree)
Hi everybody!
I am solving problem that need addition on a segment and getting sum and minimum on a segment. I have some problem with lazy propagation.
Can you share your code with Segment tree. Preferably recursively)
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 |
![]() |
jaguar1996 | 2017-04-23 18:05:51 | 259 | Initial revision for English translation | |
ru1 |
![]() |
jaguar1996 | 2017-04-23 17:45:41 | 272 | Первая редакция (опубликовано) |
Name |
---|