• 문제 링크
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;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 33646 Pencil Crayons - Greedy / Java (0) | 2025.06.08 |
---|---|
[백준] 9784 Boiled Eggs - Greedy / Java (0) | 2025.06.07 |
[백준] 9468 Islands in the Data Stream - Brute Force / Java (0) | 2025.06.05 |
[백준] 10497 Hitting the Targets - Brute Force / Java (0) | 2025.06.04 |
[백준] 6627 The Easiest Problem is This One - Brute Force / Java (0) | 2025.06.03 |
댓글