Diameter of the Point Set
Print the squared distance of the two farthest points (the diameter of the set, squared to stay integral).
Input: the first line has N; the next N lines have distinct points x y.
Output: the maximum squared pairwise distance.
Constraints:
- 1 ≤ N ≤ 105
- |coordinates| ≤ 106
Sample Tests
Input 1
3 0 0 3 4 0 1
Output 1
25
Input 2
2 0 0 5 5
Output 2
50
Discussion (opens after you solve — no spoilers before)
No comments yet.