|Online MIPT programming contest||РУССКИЙ|
Time limit = 2 second(s)You have a set of point on a plane. Your task is to find pair of the farthest points.
Input The first line contains the number of points N. 2 ≤ N ≤ 50000 Then pares of coordinates follow.
N X1 Y1 X2 Y2 X3 Y3 ... XN YN
Output Maximum distance between two points with accuracy 10-6.
3 4.0 0.00 0 3 0 0.0
Classic problem. Tests and solution by Ivanov G.
5 August 2005
© acm.mipt DevGroup
The page was generated in 200ms