树状数组uva12086

树状数组修改某个点的值

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
using namespace std;
const int maxn=200020;
int tree[maxn],N,a[maxn];
void init()
{
    for(int i=0;i<=N;i++)tree[i]=0;
}
void update(int x,int old,int v)
{
    while(x<=N)
    {
        tree[x]=tree[x]-old+v;
        x+=x&(-x);
    }
}
int getsum(int x)
{
    int ans=0;
    while(x>0)
    {
        ans+=tree[x];
        x-=x&(-x);
    }
    return ans;
}
int main()
{
    #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
    #endif

    int x,p,q,cas=1;
    char op[20];
    bool first=true;
    while(scanf("%d",&N)!=EOF,N)
    {
        if(first)first=false;
        else cout<<endl;
        printf("Case %d:\n",cas++);
        init();
        for(int i=1;i<=N;i++)
        {
            scanf("%d",&a[i]);
            update(i,0,a[i]);
        }
        while(true)
        {
            scanf("%s",op);
            if(op[0]=='E')break;
            if(op[0]=='M')
            {
                scanf("%d%d",&p,&q);
                printf("%d\n",getsum(q)-getsum(p)+a[p]);
            }
            else
            {
                scanf("%d%d",&p,&q);
                update(p,a[p],q);
                a[p]=q;
            }
        }
    }
    return 0;
}