记录编号	562671	评测结果	AAAAAAAAAAAAAAA
题目名称	数列操作A	最终得分	100
用户昵称	Sicly	是否通过	通过
代码语言	C++	运行时间	6.810 s
提交时间	2021-07-09 08:12:08	内存使用	10.04 MiB

#include<bits/stdc++.h>
using namespace std;
const int maxn=150000;
struct node
{
    int l,r;
    int sum;
 }tree[maxn*4+50];
int a[maxn+50];
int pushup(int noi)
{
    tree[noi].sum=tree[noi*2].sum+tree[noi*2+1].sum;
    return 0;
}
int build(int n,int noi,int l,int r)
{
    tree[noi].l=l;
    tree[noi].r=r;
    if(l==r)
    {
        tree[noi].sum=a[l]; 
        //cout<<noi<<' '<<l<<' '<<r<<' '<<tree[noi].sum<<endl;
        return 0;
    } 
    int mid=(r+l)/2;
    build(n,2*noi,l,mid);
    build(n,2*noi+1,mid+1,r);
    pushup(noi);
    //cout<<noi<<' '<<l<<' '<<r<<' '<<tree[noi].sum<<endl;
    return 0;
}
long long query(int noi,int l,int r,long long sum)
{
    //cout<<noi<<' '<<l<<' '<<r<<endl;
    if(l<=tree[noi].l&&r>=tree[noi].r)
    {
        sum+=tree[noi].sum;
        //cout<<noi<<' '<<tree[noi].l<<' '<<tree[noi].r<<' '<<tree[noi].sum<<endl;
        return sum;
    }
    int mid=(tree[noi].l+tree[noi].r)/2;
    if(l<=mid)sum=query(noi*2,l,min(mid,r),sum);
    if(r>mid)sum=query(noi*2+1,max(mid+1,l),r,sum);
        //cout<<noi<<' '<<tree[noi].l<<' '<<tree[noi].r<<' '<<tree[noi].sum<<endl;
    return sum;
}
int xiu(int noi,int wa,int ad)
{
    //cout<<noi<<endl;
    tree[noi].sum+=ad;
    int mid=(tree[noi].l+tree[noi].r)/2;
    if(tree[noi].l==tree[noi].r)return 0;
    if(wa<=mid)xiu(noi*2,wa,ad);
    else               xiu(noi*2+1,wa,ad);
    return 0;
}
int main()
{
    freopen ("shulie.in","r",stdin);
	freopen ("shulie.out","w",stdout);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    build(n,1,1,n);
    int q;
    cin>>q;
    for(int i=1;i<=q;i++)
    {
        string c;
        cin>>c;
        if(c[0]=='A')
        {
            int d,w;
            cin>>d>>w;
            xiu(1,d,w);
            /*for(int noi=1;noi<n*2;noi++)
            {
                cout<<noi<<' '<<tree[noi].l<<' '<<tree[noi].r<<' '<<tree[noi].sum<<endl;
            }*/
        }
        else
        {
            int l,r;
            cin>>l>>r;
            if(l>=r)swap(l,r);
            //cout<<56486486<<endl;
            cout<<query(1,l,r,0)<<endl;
        }
    }
    return 0;
}