树状数组

include

include

using namespace std;

int c[100010],n,m;

int query(int k){
int ans=0;
for(int i=k;i>0;i-=i&(-i))
ans+=c[i];
return ans;
}

void up(int k,int v){
for(int i=k;i<=n;i+=i&(-i))
c[i]+=v;
}

int main(){
scanf(“%d”,&n);
int v;
for(int i=1;i<=n;i++){
scanf(“%d”,&v);
up(i,v);
}
scanf(“%d”,&m);
int b,x,y;
for(int i=1;i<=m;i++){
scanf(“%d%d%d”,&b,&x,&y);
if(b&1)up(x,y);
else{
printf(“%d\n”,query(y)-query(x-1));
}
}
return 0;
}