一维树状数组

题目：http://acm.nyist.net/JudgeOnline/problem.php?pid=116

 

#include <iostream>
#include <string.h>
#include <stdio.h>

using namespace std;
const int N = 1000005;

int  n;
int c[N];

int Lowbit(int k)
{
    return k & (-k);
}

void add(int k,int val)
{
    for(int i=k; i<=n; i+=Lowbit(i))
        c[i]+=val;
}

int sum(int k)
{
    int ans=0;
    for(int i=k; i>0; i-=Lowbit(i))
        ans += c[i];
    return ans;
}

int main()
{
    char ch[25];
    int x,y,v,Q;
    while(~scanf("%d%d",&n,&Q))
    {
        memset(c,0,sizeof(c));
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&v);
            add(i,v);
        }
        while(Q--)
        {
            scanf("%s%d%d",ch,&x,&y);
            if(ch[0] == 'Q')
                printf("%d\n",sum(y)-sum(x-1));
            else
                add(x,y);
        }
    }
    return 0;
}