79623662

Date: 2025-05-15 15:12:18
Score: 2
Natty:
Report link
There is an O(n log n)-time algorithm for the problem.

See this answer to the crosspost at cstheory for the proof.

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: Neal Young