• 문제 링크
https://www.acmicpc.net/problem/18041
• 풀이 코드
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(), x = read(), j = read(), cnt = 1, max = 0;
for (int i = 1; i < n; i++) {
int k = read();
if (k - j <= x) cnt++;
else {
max = Math.max(max, cnt);
cnt = 1;
}
j = k;
}
bw.write(String.valueOf(Math.max(max, cnt)));
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' 카테고리의 다른 글
[백준] 17931 Greedily Increasing Subsequence - Greedy / Java (0) | 2025.05.15 |
---|---|
[백준] 16787 マルバツスタンプ (Circle Cross Stamps) - Greedy / Java (0) | 2025.05.14 |
[백준] 32585 Building Pyramids - Brute Force / Java (0) | 2025.05.12 |
[백준] 33541 2025는 무엇이 특별할까? - Brute Force / Java (0) | 2025.05.11 |
[백준] 6811 Old Fishin’ Hole - Brute Force / Java (0) | 2025.05.10 |
댓글