算法思路
即用空间换时间,注意s[0] = 0;
#include <iostream>
using namespace std;
int n,m;
const int N = 100010;
int a[N],s[N];
int main()
{
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++)
scanf("%d",&a[i]);
s[0] = 0;
//count s[n]
for(int i = 1; i <= n;i++)
s[i] = s[i-1] + a[i];
int i,j;
while(m--)
{
scanf("%d%d",&i,&j);
printf("%d\n",s[j]-s[i-1]);
}
return 0;
}