• 문제 링크
https://www.acmicpc.net/problem/13238
• 풀이 코드
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, max = 0;
while (n-- > 1) {
if (i < (j = read())) max = Math.max(max, j - i);
else i = j;
}
bw.write(String.valueOf(max));
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' 카테고리의 다른 글
[백준] 16756 Pismo - Greedy / Java (0) | 2024.05.12 |
---|---|
[백준] 30088 공포의 면담실 - Greedy / Java (0) | 2024.05.11 |
[백준] 4852 Winter Festival - Graph Theory / Java (0) | 2024.05.09 |
[백준] 7107 Journey of A Knight - Graph Theory / Java (0) | 2024.05.08 |
[백준] 26533 Tractor Path - Graph Theory / Java (0) | 2024.05.07 |
댓글