알고리즘 문제/BOJ
11441번 합 구하기
parkit
2019. 5. 9. 10:33
728x90
반응형
https://www.acmicpc.net/problem/11441
Prefix Sum : https://hsdevelopment.tistory.com/323
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 | #include <iostream> #include <deque> #include <list> #include <queue> #include <stack> #include <cstdio> #include <vector> #include <cstring> #include <string> #include <math.h> #include <algorithm> #include <map> #include <set> #include <functional> #include <unordered_map> #include <unordered_set> #include <tuple> #include <sstream> #pragma warning(disable:4996) #pragma comment(linker, "/STACK:336777216") using namespace std; int N = 0; int sum[100100] = { 0, }; int main(void) { int A = 0, s = 0, M = 0, start = 0, end = 0; bool first = true; scanf("%d", &N); for (int i = 1; i <= N; i++) { scanf("%d", &A); sum[i] += sum[i - 1] + A; } scanf("%d", &M); for (int i = 0; i < M; i++) { scanf("%d %d", &start, &end); printf("%d\n", sum[end] - sum[start - 1]); } return 0; } | cs |
728x90
반응형