How to solve F, H, J, L?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
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 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | Petr | 145 |
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].