Submission #6142790

---

Source Code Expand

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);

		int N = s.nextInt();

		Point[] points = new Point[N];
		for (int i = 0; i < N; i++) {
			double x = s.nextDouble();
			double y = s.nextDouble();

			points[i] = new Point(x, y);
		}

		double answer = 0;
		for (int i = 0; i < N-1; i++) {
			for(int j = i+1 ; j<N;j++) {
				double distance = points[i].distance(points[j]);
				if(distance > answer) {
					answer = distance;
				}
			}
		}

		System.out.println(answer);

	}

}

class Point {
	double x;
	double y;

	public Point(double x, double y) {
		super();
		this.x = x;
		this.y = y;
	}

	public double distance(Point p) {
		return Math.sqrt((x - p.x) * (x - p.x) + (y - p.y) * (y - p.y));

	}
}

Submission Info

Judge Result