Submission

Status:
PPPPPPPPPPPPPPPPPPPP

Score: 100

User: yume_snowy

Problemset: ผลบวก (กลาง)

Language: cpp

Time: 0.067 second

Submitted On: 2024-10-23 16:30:35

#include <iostream>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    int N;
    cin >> N;
    unsigned long long a[N];

    for (int i=0; i<N; i++) {
        cin >> a[i];
    }

    int prefix[N];
    int n;
    cin >> n;
    int x[n],y[n];

    for (int i=0; i<n; i++) {
        cin >> x[i] >> y[i];
    }

    prefix[0] = a[0];

    for (int i=1; i<N; i++) {
        prefix[i] = prefix[i-1]+a[i];
    }


    for (int i=0; i<n; i++) {
        cout << prefix[y[i]]-prefix[x[i]-1] << "\n";
    }

}