题目描述
输入描述:
第一行一个数n(2≤n≤1000)表示点数,接下来每行一对整数xi,yi(-1e9<=xi,yi<=1e9)表示网格上的点
输出描述:
一行输出最小面积
输入例子:
2 0 0 0 3
输出例子:
9
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
while(scan.hasNext()){
//重点是找出最大的x,y和最小的x,y
//min_x取最大整数 max_x取最小整数
int n = scan.nextInt();
int min_x = Integer.MAX_VALUE;
int max_x = Integer.MIN_VALUE;
int min_y = Integer.MAX_VALUE;
int max_y = Integer.MIN_VALUE;
int x = 0;
int y = 0;
for(int i = 0 ; i < n ; i++){
x = scan.nextInt();
y = scan.nextInt();
if(x > max_x) max_x = x;
if(x < min_x) min_x = x;
if(y > max_y) max_y = y;
if(y < min_y) min_y = y;
}
if((max_x - min_x) > (max_y - min_y)){
System.out.println((max_x - min_x) * (max_x - min_x));
}else{
System.out.println((max_y - min_y) * (max_y - min_y));
}
}
scan.close();
}
}