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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
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?
Название |
---|
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.