- O(N^2 log N) half-full enumeration
- Do O(N log N) binary search N times.
This page is auto-translated from [/nishio/N ć 1000 åå¾ć®å¶ē“](https://scrapbox.io/nishio/N ć 1000 åå¾ć®å¶ē“) using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. Iām very happy to spread my thought to non-Japanese readers.