2 solutions

  • -1
    @ 2026-6-16 12:04:26

    C语言 #include<stdio.h>

    #define MAX_N 100005

    long long prefix[MAX_N];

    int main() { int n,q; scanf("%d %d",&n,&q);

    prefix[0]=0;
    
    for(int i=1;i<=n;i++)
    {
        int val;
        scanf("%d",&val);
        prefix[i]=prefix[i-1]+val;
    }
    while(q--)
    {
        int L,R;
        scanf("%d %d",&L,&R);
    
        printf("%lld\n",prefix[R]-prefix[L-1]);
    }
    
    return 0;
    

    }

Information

ID
4
Time
1000ms
Memory
256MiB
Difficulty
2
Tags
# Submissions
33
Accepted
10
Uploaded By