• 문제 링크
https://www.acmicpc.net/problem/1668
• 풀이 코드
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()];
int l = 1, r = 1, max = arr[0] = read();
for (int i = 1; i < arr.length; i++) {
if (max < (arr[i] = read())) {
max = arr[i];
l++;
}
}
max = arr[arr.length - 1];
for (int i = arr.length - 2; i >= 0; i--) {
if (max < (arr[i])) {
max = arr[i];
r++;
}
}
bw.write(l + "\n" + r);
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}'Problem Solving > Baekjoon' 카테고리의 다른 글
| [백준] 1259 팰린드롬수 - Implementation / Java (0) | 2025.12.14 |
|---|---|
| [백준] 11098 첼시를 도와줘! - Implementation / Java (0) | 2025.12.12 |
| [백준] 3029 경고 - Implementation / Java (0) | 2025.12.10 |
| [백준] 5940 Math Practice - Brute Force / Java (0) | 2025.12.09 |
| [백준] 15121 Star Arrangements - Brute Force / Java (0) | 2025.12.08 |
댓글