Submission #23419

---

Source Code Expand

import java.util.Scanner;

public class Main {

	private static double distance(double x1, double y1, double x2, double y2) {
		double dx = x1 - x2;
		double dy = y1 - y2;
		return Math.sqrt(dx * dx + dy * dy);
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		double disx[] = new double[n + 1];
		double disy[] = new double[n + 1];
		// input
		for (int i = 0; i < n; i++) {
			disx[i] = sc.nextDouble();
			disy[i] = sc.nextDouble();
		}
		double dis = distance(disx[0], disy[0], disx[1], disy[1]);
		// calc
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if (dis < distance(disx[i], disy[i], disx[j], disy[j])) {
					dis = distance(disx[i], disy[i], disx[j], disy[j]);
				}
			}
		}
		// output
		System.out.println(dis);
	}
}

Submission Info

Judge Result