H. How Far Can We Go
Time Limit: 10.0 Seconds Memory Limit: 65536K Special Judge
Total Runs: 189 Accepted Runs: 31
Robby is a bad-tempered child, and he often quarrels or even fights with others. After the quarrelling, he often shouts to his opponent: "Go away from me, as far as possible! I never want to see you again!"
When he calms down, he finds that it is an interesting problem in fact: Given the position of all the cities, what's the maximum distance between any pairs of them?
Input
The first line of each test case contain an integer N (2 ≤ N ≤ 100000), indicating the number of cities. Then N lines followed, each line contains two numbers Xi and Yi, indicating there is a city at (Xi, Yi). (|Xi|, |Yi| ¡Ü 107)
The input is terminated with N = 0.
Output
Output one number in one line for each test case, indicating the maximum distance. Two digits after decimal point are preserved by rounding.Sample Input
4
0.0 0.0
-1.0 -1.0
0.0 -1.0
-1.0 0.0
0
Sample Output
1.41
Problem Setter: RoBa
Note: Special judge problem, you may get "Wrong Answer" when output in wrong format.
Source: Tianjin Metropolitan Collegiate Programming Contest 2007
Problem ID in problemset: 2847
Submit Back Runs Statistics Clarifications
Tianjin University Online Judge v1.2.4
