UVA 12086 Potentiometers(树状数组)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=200000+5;
int C[maxn],a[maxn];
int n;
int lowbit(int x) {return x&(-x);}
void add(int x,int d)
{
    while(x<=n){
        C[x]+=d;x+=lowbit(x);
    }
}
int sum(int x)
{
    int ret=0;
    while(x>0){
        ret+=C[x];x-=lowbit(x);
    }
    return ret;
}
int main()
{
    int kase=0;
    while(scanf("%d",&n)&&n)
    {
        memset(C,0,sizeof(C));
        for(int i=1;i<=n;i++) {scanf("%d",&a[i]);add(i,a[i]);}
        if(kase) printf("\n");
        printf("Case %d:\n",++kase);
        while(true)
        {
            char cmd[10];
            int x,y;
            scanf("%s",cmd);
            if(cmd[0]=='E') break;
            if(cmd[0]=='S'){
                scanf("%d%d",&x,&y);
                add(x,y-a[x]);
                a[x]=y;
            }
            else{
                scanf("%d%d",&x,&y);
                printf("%d\n",sum(y)-sum(x-1));
            }
        }
    }
    return 0;
}