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 | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 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. | 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 |
---|