Hello all
Can anyone tell me how to solve this problem?
Query 1 — Equate all elements in range l to r equal to x
Query 2 — Find sum of all the elements from range l to r.
Constraints : n < = 100000
Hello all
Can anyone tell me how to solve this problem?
Query 1 — Equate all elements in range l to r equal to x
Query 2 — Find sum of all the elements from range l to r.
Constraints : n < = 100000
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
This is classic segment tree with lazy propagation problem, just use google or etc...
Can you share the code?
I am new to segment trees and I am finding it tough to code the update part.
code
Thanks for your code. :)
It worked.
By the way, can we do the same update thing using a fenwick tree?
I think it's impossible to assign value on segment, using fenwick tree :(
Any particular reason for this?
read about fenwick trees
Hi, you can learn a lot from here: Easy and efficient segment trees
Basically your query 1 is a interval modification using lazy propagation (calculating only the values you need when you need them) and the query 2 is a basic range query. Everything is explained in the link I provided. GL