线段树

#include<stdio.h>
# include<string.h>
struct tree
{
    int l;
    int r;
    int sum;
}s[4*50005];  //注意开4被
int a[50005];

void build(int l,int r,int cur)   //建树
{
    s[cur].l=l;
    s[cur].r=r;
    if(l==r)
    {
        s[cur].sum=a[l];
        return ;
    }
    int mid=(l+r)/2;
    build(l,mid,2*cur);
    build(mid+1,r,2*cur+1);
    s[cur].sum=s[2*cur].sum+s[2*cur+1].sum;
}

void insert(int l,int r,int cur,int num)   //更新
{
    int mid=(s[cur].l+s[cur].r)/2;
    if(s[cur].l==s[cur].r)
    {
        s[cur].sum=s[cur].sum+num;
        return ;
    }
    if(r<=mid)
    {
        insert(l,r,2*cur,num);
    }
    else if(l>mid)
    {
        insert(l,r,2*cur+1,num);
    }
    else
    {
        insert(l,mid,2*cur,num);
        insert(mid+1,r,2*cur+1,num);
        //printf("%d %d\n",s[cur].sum,cur);
    }
    s[cur].sum=(s[2*cur].sum+s[2*cur+1].sum);
}

int query(int l,int r,int cur)   //查询
{
    int mid=(s[cur].l+s[cur].r)/2;
    if(s[cur].l==l&&s[cur].r==r)
    {
        return s[cur].sum;
    }
    else if(r<=mid)
    {
        return query(l,r,2*cur);
    }
    else if(l>mid)
    {
        return query(l,r,2*cur+1);
    }
    else
    {
        return query(l,mid,2*cur)+query(mid+1,r,2*cur+1);
    }
}

int main()
{
    int i,N,t,k=0;
   // freopen("in1.txt","r",stdin);
   scanf("%d",&t);
   while(t--)
   {
       printf("Case %d:\n",++k);
       char ch[20];
       int x,y;
       scanf("%d",&N);
       for(i=1;i<=N;i++)
       scanf("%d",&a[i]);
       build(1,N,1);
      /* for(i=1;i<20;i++)
       printf("%d ",s[i].sum);*/
       while(scanf("%s",ch))
       {
           int ans;
           if(strcmp(ch,"End")==0)
                break;
           else if(strcmp(ch,"Add")==0)
           {
               scanf("%d%d",&x,&y);
               insert(x,x,1,y);
           }
           else if(strcmp(ch,"Sub")==0)
           {
               scanf("%d%d",&x,&y);
               insert(x,x,1,-y);
           }
           else
           {
               scanf("%d%d",&x,&y);
               ans=query(x,y,1);
               printf("%d\n",ans);
           }
        }
    }
    return 0;
}