LA 2191(p247)----Potentiometers

#include<bits/stdc++.h>
#define debu
using namespace std;
typedef long long LL;
const int maxn=1e6+50;
int n,cas=0;
char cmd[4];
LL c[maxn];
LL a[maxn];
inline int lowbit(int x)
{
    return x&(-x);
}
void add(int x,LL value)
{
    for(int i=x; i<=n; i+=lowbit(i))
        c[i]+=value;
}
int sum(int x)
{
    LL tmp=0;
    for(int i=x; i; i-=lowbit(i))
        tmp+=c[i];
    return tmp;
}
int main()
{
#ifdef debug
    freopen("in.in","r",stdin);
#endif // debug
    while(scanf("%d",&n)==1&&n)
    {
        cas++;
        if(cas!=1) printf("\n");
        memset(a,0,sizeof(a));
        memset(c,0,sizeof(c));
        printf("Case %d:\n",cas);
        for(int i=1; i<=n; i++)
        {
            scanf("%lld",&a[i]);
            add(i,a[i]);
        }
        while(scanf("%s",cmd)&&(cmd[0]!='E'))
        {
            LL y;
            int x;
            scanf("%d%lld",&x,&y);
            if(cmd[0]=='S')
            {
                add(x,-a[x]);
                add(x,y);
                a[x]=y;
            }
            else
            {
                //cout<<sum(y)<<" "<<sum(x-1)<<endl;
                printf("%lld\n",(LL)sum(y)-sum(x-1));
            }
        }
    }
    return 0;
}

题目地址：https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=192

题解：树状数组。