树状数组模板程序

#include<iostream>
#include<cstring>
#include<cstdio> 
#include<vector>
#define N 500100
using namespace std;
int n,m,c[N];
int lowbit(int x)
{
    return x&(-x);
}
void update(int x,int y)
{
    while(x<=n)
    {
        c[x]+=y;
        x+=lowbit(x);
    }
}
int sum(int x)
{
    int ans=0;
    while(x>0)
    {
        ans+=c[x];
        x-=lowbit(x);
    }
    return ans;
}
int main()
{
    scanf("%d%d",&n,&m);
    int x,y,z;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        update(i,x);
    }
     
    while(m--)
    {
        scanf("%d%d%d",&x,&y,&z);
        if(x==1)    update(y,z);
        else printf("%d\n",sum(z)-sum(y-1));
    }
    return 0;
 }