SDUT-3771

题目链：SDUT-3771

`#include
#include<bits/stdc++.h>
using namespace std;
struct node
{
int l,r;
long long data;
} tree[1000005];
long long num[1000005];
void build(int id,int l,int r)
{
tree[id].l=l;
tree[id].r=r;
if(l==r)
tree[id].data=num[l];
else
{
int mid=(l+r)/2;
build(id2+1,l,mid);
build(id2+2,mid+1,r);
tree[id].data=tree[id2+1].data+tree[id2+2].data;
}

}
long long query(int id,int l,int r)
{
int left=tree[id].l;
int right=tree[id].r;
if(left>r||right<l)
return 0;
l=max(left,l);
r=min(right,r);
if(leftl&&rightr)
return tree[id].data;
return query(2id+1,l,r)+query(2id+2,l,r);

}
void update(int id,int pos,long long int data)
{
int left=tree[id].l;
int right=tree[id].r;
if(left>pos||right<pos)
return ;
tree[id].data+=data;
if(left==right)
return ;
update(id2+1,pos,data);
update(id2+2,pos,data);
}

int main()
{
ios::sync_with_stdio(false); //快速输入的函数，记住
int n;
while (cin>>n)
{
for(int i=0; i<n; i++)
cin>>num[i];
build(0,0,n-1);
int q;
cin>>q;
long long v;
int p,l,r;
while(q–)
{
int m;
cin>>m;
if(m==2)
{
cin>>l>>r;

            cout<<query(0,l-1,r-1)<<endl;
        }
        else if(m==1)
        {
            cin>>p>>v;
            update(0,p-1,v);
        }
    }
}
return 0;

}

/***************************************************
User name: sm180216刘志鹏
Result: Accepted
Take time: 592ms
Take Memory: 5104KB
Submit time: 2019-08-13 16:07:53
****************************************************/`