№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 149 |
6 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
Название |
---|
Consider oranges as +1 and apples as -1.
Do the partial sum on the array. Now we want to find for every i , the maximum j such that for each i < = k < = j, partial[k] > = partial[i] .
You can find such j using binary search and RMQ. (This is possible with simple stack too in O(n) ).
For all i (1 <= i <= n) calc the largest p[i] such that for all i <= k <= p[i] count of 'p' in a[i:k] > count of 'j' in a[i:k] it can be done using prefixes and binary search
Similarly, calc s (for all (1 <= i <= n) lowest s[i] such adding fruits from i to s[i] is possible)
Make tree segment on s. Bruteforce left part of line. To find answer which starts in left you need to find the largest t such s[t] <= left for i <= t <= p[left], t can be finded by down search in tree segment
Can you show me Code
https://pastebin.com/V9duKDsD