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?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
2 | maomao90 | 162 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|