본문 바로가기
Problem Solving/Baekjoon

[백준] 18025 Hot Hike - Brute Force / Java

by graycode 2025. 6. 6.

 문제 링크

https://www.acmicpc.net/problem/18025

 

 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        int[] arr = new int[read()];
        for (int i = 0; i < arr.length; i++) arr[i] = read();

        int min = Math.max(arr[0], arr[2]), day = 1;
        for (int i = 3; i < arr.length; i++) {
            int tmp = Math.max(arr[i - 2], arr[i]);
            if (min > tmp) {
                min = tmp;
                day = i - 1;
            }
        }

        bw.write(day + " " + min);
        bw.flush();
    }

    private static int read() throws IOException {
        int c, n = System.in.read() & 15;
        boolean flag = n == 13;

        if (flag) n = System.in.read() & 15;
        while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);

        return flag ? ~n + 1 : n;
    }

}

댓글