Envío 1691

Código

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;

int main()
{
    int n, c, x, y;
    int a[50001];
    int p[50001];
    cin>>n;
    for(int i = 0; i < n; i++)
    {
        cin>>a[i];
        if(i==0) p[i] = a[i];
        else p[i] = p[i-1] + a[i];
    }
    cin>>c;
    /*cout<<endl<<"RES:"<<endl;
    for(int i = 0; i < n; i++)
    {
        cout<<p[i]<<endl;
    }*/
    for(int i = 0; i < c; i++)
    {
        cin>>x>>y;
        int suma = 0;
        if(x>0) suma = p[y] - p[x-1];
        else suma = p[y];
        cout<<suma<<endl;
    }
}