HDU 1166 敌兵布阵

复习线段树，把NotOnlySuccess上面的推荐题目都刷一遍。

需求：单点更新，区间求和。

#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>

using namespace std;

#pragma pack(4)

const double  eps = 1e-8;
const double   pi = acos(-1.0);
const int     inf = 0x7f7f7f7f;
const __int64 INF = 0x7f7f7f7f7f7f7f7fll;

#define loop(a,n)                            \
    for(int i=0;n>i;i++)                     \
        cout<<a[i]<<(i!=n-1?' ':'\n')
#define loop2(a,n,m)                         \
    for(int i=0;n>i;i++)                     \
        for(int j=0;m>j;j++)                 \
            cout<<a[i][j]<<(j!=m-1?' ':'\n')

#define   at(a,i) ((a)&(1<<(i)))
#define   nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))

#define gret(a,b) (((a)-(b))>eps)
#define less(a,b) (((b)-(a))>eps)
#define greq(a,b) (((a)-(b))>-eps)
#define leeq(a,b) (((b)-(a))>-eps)
#define equl(a,b) (fabs((a)-(b))<eps)

#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (gret(a,b)?(a):(b))
#define fmin(a,b) (less(a,b)?(a):(b))

const int MAXV = 50002;

char o[10];
int tcase,times=1,u,w,n;

int sum[MAXV<<2],lazy[MAXV<<2];

#define lc(i) ((i)<<1)
#define rc(i) ((i)<<1|1)

void up(int i)
{
    sum[i]=sum[lc(i)]+sum[rc(i)];
}
void down(int i)
{
    lazy[lc(i)]+=lazy[i];
    lazy[rc(i)]+=lazy[i];
    sum[lc(i)]+=lazy[i];
    sum[rc(i)]+=lazy[i];
    lazy[i]=0;
}
void change(int x,int y,int w,int l=1,int r=n,int i=1)
{
    if(x<=l&&r<=y)
    {
        sum[i]+=w;
        lazy[i]+=w;
    }
    else
    {
        if(lazy[i]) down(i);

        if(x<=(l+r)/2) change(x,y,w,l,(l+r)/2,lc(i));
        if((l+r)/2<y) change(x,y,w,(l+r)/2+1,r,rc(i));

        up(i);
    }
}
int query(int x,int y,int l=1,int r=n,int i=1)
{
    if(x<=l&&r<=y) return sum[i];
    else
    {
        if(lazy[i]) down(i);

        int cnt=0;
        if(x<=(l+r)/2) cnt+=query(x,y,l,(l+r)/2,lc(i));
        if((l+r)/2<y) cnt+=query(x,y,(l+r)/2+1,r,rc(i));

        return cnt;
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("µÐ±ø²¼Õó.txt","r",stdin);
    #endif

    scanf("%d",&tcase);while(tcase--)
    {
        memset(sum,0,sizeof(sum));
        memset(lazy,0,sizeof(lazy));
        scanf("%d",&n);
        for(int i=1;n>=i;i++)
        {
            scanf("%d",&w);
            change(i,i,w);
        }
        getchar();
        printf("Case %d:\n",times++);
        while(scanf("%s",o),strcmp(o,"End"))
        {
            scanf("%d %d",&u,&w);
            if(!strcmp(o,"Query")) printf("%d\n",query(u,w));
            else if(!strcmp(o,"Add")) change(u,u,+w);
            else if(!strcmp(o,"Sub")) change(u,u,-w);
        }
    }
    return 0;
}