LightOJ 1112

线段树练习

#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rel(i,n) for(int (i)=1;(i)<=(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define delf int m=(l+r)>>1
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
const int MAXN=1e5;const int MOD=1e9+7;
const int MAXNODES=MAXN<<2;
int sum[MAXNODES];
int lazy[MAXNODES];
void pushup(int rt)
{
    sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void pushdown(int rt,int m)
{
    if(lazy[rt])
    {
        sum[rt<<1]+=lazy[rt]*(m-(m>>1));
        sum[rt<<1|1]+=lazy[rt]*(m>>1);
        lazy[rt<<1]+=lazy[rt];
        lazy[rt<<1|1]+=lazy[rt];
        lazy[rt]=0;
    }
}
void build(int l,int r,int rt)
{
    lazy[rt]=0;
    if(l==r)
    {
        scanf("%d",&sum[rt]);
        return;
    }
    delf;
    build(lson);
    build(rson);
    pushup(rt);
}
void update(int L,int R,int c,int l,int r,int rt)
{
    if(L<=l&&R>=r)
    {
        lazy[rt]+=c;
        sum[rt]+=c*(r-l+1);
        return;
    }
    delf;
    pushdown(rt,r-l+1);
    if(L<=m) update(L,R,c,lson);
    if(R>m) update(L,R,c,rson);
    pushup(rt);
}
int query(int L,int R,int l,int r,int rt)
{
    if(L<=l&&R>=r) return sum[rt];
    delf;
    int ret=0;
    pushdown(rt,r-l+1);
    if(L<=m) ret+=query(L,R,lson);
    if(R>m) ret+=query(L,R,rson);
    return ret;
}
int main()
{
    int t,n,q,tem,a,b;
    scanf("%d",&t);
    rel(i,t)
    {
        memset(lazy,0,sizeof(lazy));
        memset(sum,0,sizeof(sum));
        scanf("%d%d",&n,&q);
        build(1,n,1);
        printf("Case %d:\n",i);
        while(q--)
        {
            scanf("%d%d",&tem,&a);
            a++;
            if(tem==1)
            {
                int ans=query(a,a,1,n,1);
                printf("%d\n",ans);
                update(a,a,-ans,1,n,1);
            }
            else if(tem==2)
            {
                scanf("%d",&b);
                update(a,a,b,1,n,1);
            }
            else
            {
                scanf("%d",&b);
                b++;
                int ans=query(a,b,1,n,1);
                printf("%d\n",ans);
            }
        }
    }
    return 0;
}