dev.Log
11659 구간합 본문
package acmicpc;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class divisionSum {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(bufferedReader.readLine());
int suNo = Integer.parseInt(st.nextToken());
int quizNo = Integer.parseInt(st.nextToken());
st = new StringTokenizer(bufferedReader.readLine());
long[] S = new long[suNo + 1]; //구간합구하기
for(int i=1; i <= suNo; i++) {
S[i] = S[i-1] + Integer.parseInt(st.nextToken());
}
for(int q=0; q<quizNo; q++) {
st = new StringTokenizer(bufferedReader.readLine());
int i = Integer.parseInt(st.nextToken());
int j = Integer.parseInt(st.nextToken());
System.out.println(S[j]-S[i-1]);
}
}
}
'알고리즘' 카테고리의 다른 글
2018 연속합 (0) | 2022.09.05 |
---|---|
10986 나머지합구하기 (0) | 2022.09.04 |
1546 평균구하기 (0) | 2022.09.02 |
11720 숫자의합 (0) | 2022.09.02 |
시간 복잡도 표기법 (0) | 2022.09.01 |
Comments