Submission #23135

---

Source Code Expand

import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;

public class Main {

	int INF = 1 << 28;

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		P[] ps = new P[n];
		for(int i=0;i<n;i++) {
			ps[i] = new P((double)sc.nextDouble(), (double)sc.nextDouble());
		}
		
		double len = 0;
		for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) {
			len = max(len, d(ps[i], ps[j]));
		}
		System.out.println(len);
	}
	
	double d(P p1, P p2) {
		double dx = p1.x - p2.x;
		double dy = p1.y - p2.y;
		return sqrt(dx * dx + dy * dy);
	}
	
	class P {
		double x, y;
		P(double x, double y) {
			this.x = x;
			this.y = y;
		}
	}
	
	public static void main(String[] args) {
		new Main().run();
	}

	void debug(Object... os) {
		System.err.println(Arrays.deepToString(os));
	}
}

Submission Info

Judge Result