<PREV Problem:
NEXT>
Solved by 136 users: ...
UserDateAttemptTimeCMSC
NDAT30 nov 2006FPC1000.08172 
NDAT30 nov 2006FPC800.08174 
NDAT30 nov 2006FPC900.08185 
AVD07 feb 2007FPC900.18196 
NDAT30 nov 2006FPC700.08197 
nt_d230 nov 2006FPC1800.08205 
Skyslars30 nov 2006FPC4000.08265 
Skyslars30 nov 2006FPC3900.08275 
zloySHEFF07 dec 2010C++11900.11278 
checkil08 dec 2010C++100.12278 
DD11 aug 2005Kylix501.94328 
DeniskaB11 jan 2007C++800.66329 
Jarovit09 oct 2008C++100.12348 
NghDuc18 dec 2006FPC500.14379 
Languages
C++
92
FPC
24
Kylix
12
Java
6
Ruby
1
C
1
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 

Farthest points

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.

Input#1
3
4.0	0.00
0	3
0	0.0
Output#1
5.0

Author:
Classic problem. Tests and solution by Ivanov G.
5 August 2005

<PREV | Problem set | Search related messages | NEXT>


© acm.mipt DevGroup
The page was generated in 190ms

SW soft NIX
ID = 3.235.29.190