Let array a1,...,an, (1<=n<=10^6)
3 kinds of quarries, m in total (1<=m<=10^6)
1 l r k: add k to al,...,ar 2 l r k: change ai (l<=i<=r) in to max(ai,k) 3 l r: print max(al,...,ar)
I think it could be done it at mlogn by segment tree. How can I?
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 159 |
5 | nor | 155 |
6 | maroonrk | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 145 |
9 | pajenegod | 145 |
How can I solve this range quarry problem?
Let array a1,...,an, (1<=n<=10^6)
3 kinds of quarries, m in total (1<=m<=10^6)
1 l r k: add k to al,...,ar 2 l r k: change ai (l<=i<=r) in to max(ai,k) 3 l r: print max(al,...,ar)
I think it could be done it at mlogn by segment tree. How can I?
Name |
---|