Submission

Score: 100

User: Seng

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

Language: cpp

Time: 0.152 second

Submitted On: 2026-01-03 11:32:56

#include <bits/stdc++.h>
using namespace std;
int arr[1000001];
int dp[1000001];

int main(){

    int n;
    cin >> n;
    int q;
    


    for(int i = 0; i < n; i++){
        cin >> arr[i];
        if(i == 0) dp[0] = arr[0];
        else dp[i] = dp[i-1] + arr[i];
    }

    cin >> q;

    for(int k = 0; k < q; k++){
        int ans = 0, x, y;
        cin >> x >> y;
        ans = dp[y] - dp[x-1];
        cout << ans << '\n';
    }

    
    
    
    

    

    return 0;
}