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 | 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 | 164 |
2 | cry | 160 |
2 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | atcoder_official | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
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) |
Название |
---|