太简单了没有思路,公式:b[后面坐标]-b[前面坐标减1]

zhangjinghao 2023-12-13 17:46:13 2023-12-13 17:46:23 3 返回题目

#include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010], n, q, l, r;
int main() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        b[i] = b[i - 1] + a[i];
    }
    for (int i = 1; i <= q; i++) {
        cin >> l >> r;
        cout << b[r] - b[l - 1] << endl;
    }
    return 0;
}
{{ vote && vote.total.up }}