How to solve F, H, J, L?
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
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 |
How to solve F, H, J, L?
Name |
---|
J can be solved with Mo. Let's firstly solve the x < y queries, then reverse the field and solve the rest. The answer for the query is the sum of suffix maximums + suf[x] (suffix maximum from x to y) multiplied by the distance to the rightmost element to the left to x greater than suf[x]. Code the kind of Mo where you only add elements. Now you can either add element to the right of the previous query, that is just maintaining a stack with the best values, or add element to the left, that is adding a new suffix maximum. The first part of the sum for the query is calculated, the second part can be derived with the use of some kind of precalc and suf[x].