#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int a[100],n,m;
int lowbit(int x)
{
return x&(-x);
}
void add(int pos,int x)
{
while(pos<=n){
a[pos]+=x;
pos+=lowbit(pos);
}
}
int sum(int x)
{
int s=0;
while(x>0){
s+=a[x];
x-=lowbit(x);
}
return s;
}
int main()
{
while(~scanf("%d %d",&n,&m))
{
memset(a,0,sizeof(a));
int x;
for(int i=1;i<=n;i++){
scanf("%d",&x);
add(i,x);
}
for(int i=0;i<m;i++){
int x,y;
scanf("%d %d",&x,&y);
cout << sum(y)-sum(x-1) << endl;
}
}
return 0;
}
树状数组模板
最新推荐文章于 2017-10-18 21:16:52 发布