• 문제 링크
https://www.acmicpc.net/problem/2846
• 풀이 코드
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 n = read(), i = read(), j = i, k = 0, max = 0;
while (n-- > 1) {
if ((k = read()) <= j) {
max = Math.max(max, j - i);
i = k;
}
j = k;
}
bw.write(String.valueOf(Math.max(max, k - i)));
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' 카테고리의 다른 글
[백준] 14719 빗물 - Implementation / Java (0) | 2024.11.21 |
---|---|
[백준] 5355 화성 수학 - Implementation / Java (0) | 2024.11.20 |
[백준] 10804 카드 역배치 - Implementation / Java (0) | 2024.11.18 |
[백준] 20359 A simple task - Brute Force / Java (0) | 2024.11.17 |
[백준] 8658 Liczba - Brute Force / Java (0) | 2024.11.16 |
댓글