Submission #435695

---

Source Code Expand

import java.util.Scanner;

public class Main{
	public static void main(String[] args){
		int n;
		double len, maxlen = 0;
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		int[][] p = new int[n][2];
		for(int i = 0; i < n; i++){
			p[i][0] = sc.nextInt();
			p[i][1] = sc.nextInt();
		}
		for(int i = 0; i < n - 1; i++){
			for(int j = i + 1; j < n; j++){
				len = Math.sqrt(Math.pow(p[i][0] - p[j][0], 2) + Math.pow(p[i][1] - p[j][1], 2));
				if(len > maxlen) maxlen = len;
			}
		}
		System.out.println(maxlen);
	}
}

Submission Info

Judge Result