• 문제 링크
https://www.acmicpc.net/problem/14719
• 풀이 코드
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));
read();
int[] arr = new int[read()];
for (int i = 0; i < arr.length; i++) arr[i] = read();
int sum = 0;
for (int i = arr.length - 2; i >= 1; i--) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) l = Math.max(l, arr[j]);
for (int j = i + 1; j < arr.length; j++) r = Math.max(r, arr[j]);
if (arr[i] < l && arr[i] < r) sum += Math.min(l, r) - arr[i];
}
bw.write(String.valueOf(sum));
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' 카테고리의 다른 글
[백준] 9506 약수들의 합 - Implementation / Java (0) | 2024.11.23 |
---|---|
[백준] 2979 트럭 주차 - Implementation / Java (0) | 2024.11.22 |
[백준] 5355 화성 수학 - Implementation / Java (0) | 2024.11.20 |
[백준] 2846 오르막길 - Implementation / Java (0) | 2024.11.19 |
[백준] 10804 카드 역배치 - Implementation / Java (0) | 2024.11.18 |
댓글