• 문제 링크
https://www.acmicpc.net/problem/1392
• 풀이 코드
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 n = read(), q = read(), sum = 0;
int[] tmp = new int[n + 1];
for (int i = 1; i <= n; i++) sum += tmp[i] = read();
int[] arr = new int[sum];
for (int i = 0, j = 1; j <= n; j++) {
int k = tmp[j];
while (k-- > 0) arr[i++] = j;
}
while (q-- > 0) sb.append(arr[read()]).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' 카테고리의 다른 글
[백준] 1996 지뢰 찾기 - Implementation / Java (0) | 2025.09.04 |
---|---|
[백준] 7600 문자가 몇갤까 - Implementation / Java (0) | 2025.09.03 |
[백준] 8949 대충 더해 - Implementation / Java (0) | 2025.09.01 |
[백준] 16431 베시와 데이지 - Implementation / Java (0) | 2025.08.31 |
[백준] 3035 스캐너 - Implementation / Java (0) | 2025.08.30 |
댓글