I am stuck at this problem currently.
I have tried a O(n^2) approach but the accepted solution is supposedly O(log(n)*n) or less. How do solve this?
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
I am stuck at this problem currently.
I have tried a O(n^2) approach but the accepted solution is supposedly O(log(n)*n) or less. How do solve this?
Name |
---|
Why not just link the problem instead of copy-pasting the statement?
This problem seems like this problem: https://atcoder.jp/contests/dp/tasks/dp_z
You can solve this problem using a Li-Chao tree.