Given two arrays a[n] , b[m] and q queries : In each query we have to update b[a[i]] to x for i = {l......r}
If not segment trees ,is there any efficient method to process such queries ?
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
Given two arrays a[n] , b[m] and q queries : In each query we have to update b[a[i]] to x for i = {l......r}
If not segment trees ,is there any efficient method to process such queries ?
Name |
---|
Yes. Maintain an array $$$c$$$ where $$$c[i]$$$ stores the value of $$$b[a[i]]$$$. Carry out all the updates on this array first, then map the indices back to the original indices and do whatever you want to do with the array. This assumes $$$a$$$ is fixed throughout.
Edit: This works only if $$$a$$$ doesn't have duplicates.