Submission #435640

---

Source Code Expand

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();

		int[] x = new int[N];
		int[] y = new int[N];

		for (int i = 0; i < N; i++) {
			x[i] = sc.nextInt();
			y[i] = sc.nextInt();
		}

		double longest = 0;
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				double length = Math.sqrt((double) (x[i] - x[j])
						* (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));
				if (length > longest) {
					longest = length;
				}
			}
		}
		System.out.println(longest);
		sc.close();
	}
}

Submission Info

Judge Result