二维数组
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n=cin.nextInt();
double[][] a=new double [n][2];
for(int i=0;i<n;i++)
{
a[i][0]=cin.nextDouble();
a[i][1]=cin.nextDouble();
}
double answer=0.0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
double t=Math.sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]));
if(t>answer)
{
answer=t;
}
}
}
System.out.printf("%.4f\n",answer);
}
}
类
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n=cin.nextInt();
Point[] point=new Point[n];
for(int i=0;i<n;i++)
{
point[i]=new Point(cin.nextDouble(),cin.nextDouble());
}
double answer=0.0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
double t=point[i].dis(point[j]);
if(t>answer)
{
answer=t;
}
}
}
System.out.printf("%.4f\n",answer);
}
}
class Point
{
double x;
double y;
public Point(double x, double y) {
super();
this.x = x;
this.y = y;
}
public double dis(Point p)
{
return Math.sqrt((this.x-p.x)*(this.x-p.x)+(this.y-p.y)*(this.y-p.y));
}
}