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 | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | atcoder_official | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
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 |
---|