敌兵布阵 HDU - 1166 板子题

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = ;
int n;
int l,r;
int t;
int x;
int a[N];
int tr[N<<];
char s[];
int lowbit(int x)
{
    return x & -x;
}
void add(int x, int c)
{
    for (int i = x; i <= n; i += lowbit(i))
        tr[i] += c;
}
int sum(int x)
{
    int res = ;
    for (int i = x; i; i -= lowbit(i))
        res += tr[i];
    return res;
}
int main()
{
    cin>>t;
    int kase=;

    while(t--)
    {
        cin>>n;
        memset(tr,,sizeof tr);
        for(int i=;i<=n;i++)
            cin>>x,add(i,x);
        printf("Case %d:\n", ++kase);
        while(cin>>s)
        {
            if(s[]=='E')
                break;
            cin>>l>>r;
            if(s[]=='A')
                add(l,r);
            else if(s[]=='S')
                add(l,-r);
            else if(s[]=='Q')
                cout<<sum(r)-sum(l-)<<endl;
        }
    }
}