Problem 3710 · Hard

Maximum Partition Factor

Split the points into two non-empty groups to maximize the smallest Manhattan distance between any two points in the same group. With only two points there are no such pairs, and the answer is 0.

Open the interactive visualisation