• 문제 링크
https://www.acmicpc.net/problem/5359
• 풀이 코드
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));
StringBuilder sb = new StringBuilder();
int t = read();
while (t-- > 0) {
int[] arr = new int[read()];
int m = read(), c = read();
for (int i = 0; i < arr.length; i++) arr[i] = read();
int cnt = 0;
for (int i = m; i <= arr.length; i++) {
int min = 1000, max = 0;
for (int j = i - m; j < i; j++) {
min = Math.min(min, arr[j]);
max = Math.max(max, arr[j]);
}
if (max - min <= c) cnt++;
}
sb.append(cnt).append('\n');
}
bw.write(sb.toString());
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' 카테고리의 다른 글
[백준] 6942 9966 - Brute Force / Java (0) | 2025.08.21 |
---|---|
[백준] 16847 Teenage Mutant - Brute Force / Java (0) | 2025.08.19 |
[백준] 8676 Figury - Brute Force / Java (0) | 2025.08.19 |
[백준] 2729 이진수 덧셈 - Implementation / Java (0) | 2025.08.17 |
[백준] 5363 요다 - Implementation / Java (0) | 2025.08.16 |
댓글