Files
Data-Structure/Algorithm/PrefixAndSuffix/P8218 【深进1.例1】求区间和.cpp
2025-09-21 12:21:50 +08:00

26 lines
499 B
C++

#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> sum(n + 1);
sum[0] = 0;
for (int i = 1; i < n + 1; i++) {
int tmp;
cin >> tmp;
sum[i] = sum[i - 1] + tmp;
}
int cnum;
cin >> cnum;
vector<pair<int, int>> check(cnum);
for (int i = 0; i < cnum; i++) {
cin >> check[i].first >> check[i].second;
}
for (int i = 0; i < cnum; i++) {
cout << sum[check[i].second] - sum[check[i].first - 1] << endl;
}
return 0;
}