洛谷 P1927 防护伞 Java

最新推荐文章于 2024-06-07 08:25:31 发布

Gengar021127

最新推荐文章于 2024-06-07 08:25:31 发布

阅读量35

点赞数

分类专栏：洛谷刷题之旅文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/gengar021127/article/details/133610453

版权

洛谷刷题之旅专栏收录该内容

36 篇文章 0 订阅

订阅专栏

import java.io.*;

public class Main {

    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
    static double PI = 3.1415926535;
    static int[][] array;
    static double area;
    static int N;

    public static void main(String[] args) throws IOException{
        boolean flag;
        N = Integer.parseInt(br.readLine());
        array = new int[N][2];
        area = Double.MAX_VALUE;
        for(int i = 0 ; i < N ; i++){
            String[] S = br.readLine().split(" ");
            flag = true;
            for (String s : S) {
                if (!s.isEmpty() && flag) {
                    array[i][0] = Integer.parseInt(s);
                    flag = false;
                } else if (!flag && !s.isEmpty()) {
                    array[i][1] = Integer.parseInt(s);
                }
            }

        }
        Min();
        System.out.printf("%.4f",area);
        //out.flush();
        out.close();
        br.close();
    }

    private static void Min(){
        for(int i = 0 ; i < N ; i++){
            area = Math.min(area , PI * Math.pow(Max(i) , 2));
        }
    }

    private static double Max(int index){
        double r;
        r = Double.MIN_VALUE;
        for(int i = 0 ; i < N ; i++){
            if(i == index){
                continue;
            }
            r = Math.max(r , Distance(index , i));
        }
        return r;
    }

    private static double Distance(int index1 , int index2){
        return Math.sqrt(Math.pow(array[index2][0]-array[index1][0] , 2) + (Math.pow(array[index2][1]-array[index1][1] , 2)));
    }
}

ps：这道题对Java的输入可真不友好！