| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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?
Isn't this $$$\mathcal{O}(mn)$$$ anyway, if someone decides to just spam
3 1 nover and over and over again.You would have to print only the largest value, am I wrong?
Ah, forgive me, I horribly misread. I thought it asked to print all the elements in the range, which is quite stupid of me tbh.
Anyway, the comment of tfg should answer the question pretty well.
You're correct, you can do it better than quadratic. Read https://mirror.codeforces.com/blog/entry/57319, it's in there as task 2.