#include <iostream>
#include <cstdio>
typedef long long ll;
const int MAX = 5e4 + 5;
ll arr[MAX];
int main()
{
int num;
scanf("%d", &num);
ll tmp;
for (int i = 1; i <= num; ++i)
{
scanf("%lld", &tmp);
arr[i] = arr[i - 1] + tmp;
}
int cnt;
scanf("%d", &cnt);
for (int i = 0; i != cnt; ++i)
{
int be, ed;
scanf("%d%d", &be, &ed);
printf("%lld\n", arr[ed + be - 1] - arr[be - 1]);
}
return 0;
}
51nod 1081 子段求和
最新推荐文章于 2017-09-19 20:05:00 发布