利用前缀和解决多次询问数组区间和的 C++ 实现

```cpp #include <iostream> using namespace std; int main() { int n, m; cin >> n >> m; int a[100001]; int prefixSum[100001] = {0}; for (int i = 1; i <= n; ++i) { cin >> a[i]; prefixSum[i] = prefixSum[i - 1] + a[i]; } for (int i = 0; i < m; ++i) { int k; cin >> k; cout << prefixSum[k - 1] << endl; } return 0; } ``` ######[AI问答 | 185点数解答 | 2026-05-30 19:20:15]