HDOJ 1166 排兵布阵（线段树）

the question is here
I have nothing to say but one sentence : zkw NB!

#include <bits/stdc++.h>
#include <cstring>
using namespace std;
const int maxn = 500000 + 10;
struct Node
{
    int sum,mx,mn;
} T[maxn<<2];
int M,a[maxn];
void build(int n)
{
    for( M = 1; M <= n+1; M <<= 1);               //storage parameter
    for( int i = M + 1; i <= M + n; i++ )T[i].sum =a[i-M];
    for( int i = M - 1; i; i-- )
    {
        T[i].sum = T[i<<1].sum + T[i<<1|1].sum;
    }
}
void update(int x,int v,int A = 0)
{

    for( T[x+=M].sum += v,x >>= 1; x; x >>= 1)
    {
        T[x].sum = T[x<<1].sum + T[x<<1|1].sum;
    }

}
int querySum(int l,int r,int res = 0)
{
    //expand the parameter
    for( l = l + M - 1,r = r + M + 1; l^r^1; l >>= 1,r >>= 1 )
    {
        if(~l&1)res += T[l^1].sum;
        if( r&1)res += T[r^1].sum;
    }
    return res;
}
int main()
{
    ios::sync_with_stdio(0);
    int t,n;
    cin>>t;
    for(int T=1; T<=t; T++)
    {
        cin>>n;
        for(int i=1; i<=n; i++)
        {
            cin>>a[i];
        }
        build(n);
        cout<<"Case "<<T<<":"<<endl;
        string str;
        int s,t;
        while(cin>>str)
        {
            if(str == "End") break;
            cin>>s>>t;
            if(str == "Add")
            {
                update(s,t);
            }
            if(str == "Sub")
            {
                update(s,-t);
            }
            if(str == "Query")
            {
                cout<<querySum(s,t)<<endl;
            }
        }

    }
    return 0;
}