Hello codeforces, I want to know whether there is any solution to this problem that is better than the naive O(N ^ 2) or not?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | maroonrk | 152 |
4 | nor | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
How to solve this Problem in O(N) or O(N * logN) or anything better than O(N^2).
Hello codeforces, I want to know whether there is any solution to this problem that is better than the naive O(N ^ 2) or not?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 |
![]() |
shekabhi1208 | 2021-12-10 20:32:07 | 521 | Tiny change: 'le Input\n2\n5 6\n' -> 'le Input\n\n2\n5 6\n' | |
en1 |
![]() |
shekabhi1208 | 2021-12-10 20:22:13 | 375 | Initial revision (published) |
Название |
---|