I know about segment trees. But here I am stuck.I want to set all the values within an interval [l,r] to a constant c. and now after doing all the updates on the array, I want to find a[i] where 0<i<=n.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I know about segment trees. But here I am stuck.I want to set all the values within an interval [l,r] to a constant c. and now after doing all the updates on the array, I want to find a[i] where 0<i<=n.
Name |
---|
I want the ith element a[i] after many updations .
a[]={1,2,3,4,5};
query1=1 4 3 // this means change the value of all elements to 3 in the range [1,4] so after first query a becomes a[]={3,3,3,3,4,5};
query2= 3 4 1 // this means change the value of all elements to 4 in range [3,4] a become a[]={3,3,1,1,4,5}
so I want the value of a[3](which is 1 in this case) after many queries. Hope you guys understood the question.
You can use segment tree with lazy propogation for Kind of queries you have !