【模板】树状数组

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
#define rg register
const int N=500000+5,M=200000+5,inf=0x3f3f3f3f,P=19650827;
int n,m;
ll tree[N<<1];
template <class t>void rd(t &x){
    x=0;int w=0;char ch=0;
    while(!isdigit(ch)) w|=ch==‘-‘,ch=getchar();
    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    x=w?-x:x;
}

#define Max(x,y) (x)>(y)?(x):(y)
#define Min(x,y) (x)>(y)?(y):(x)
int lowbit(int x){return x&(-x);}

void update(int pos,ll add){
    while(pos<=n) tree[pos]+=add,pos+=lowbit(pos);
}

ll query(ll pos){
    ll ans=0;
    while(pos>0) ans+=tree[pos],pos-=lowbit(pos);
    return ans;
}

int main(){
//    freopen("in.txt","r",stdin);
    rd(n),rd(m);
    for(ll i=1,x;i<=n;++i) rd(x),update(i,x);
    while(m--){
        int op,x,y;
        rd(op),rd(x),rd(y);
        if(op==1) update(x,y);
        else printf("%lld\n",query(y)-query(x-1));
    }
    return 0;
}
 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
#define rg register
const int N=500000+5,M=200000+5,inf=0x3f3f3f3f,P=19650827;
int n,m;
ll tree[N<<1],a[N<<1];
template <class t>void rd(t &x){
    x=0;int w=0;char ch=0;
    while(!isdigit(ch)) w|=ch==‘-‘,ch=getchar();
    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    x=w?-x:x;
}

#define Max(x,y) (x)>(y)?(x):(y)
#define Min(x,y) (x)>(y)?(y):(x)
int lowbit(int x){return x&(-x);}

void update(int pos,ll ad){
    while(pos<=n) tree[pos]+=ad,pos+=lowbit(pos);
}

ll query(ll pos){
    ll ans=0;
    while(pos>0) ans+=tree[pos],pos-=lowbit(pos);
    return ans;
}

int main(){
//    freopen("in.txt","r",stdin);
    rd(n),rd(m);
    for(ll i=1,x;i<=n;++i) rd(a[i]),update(i,a[i]-a[i-1]);
    while(m--){
        int op,x,y,k;
        rd(op),rd(x);
        if(op==1) rd(y),rd(k),update(x,k),update(y+1,-k);
        else printf("%lld\n",query(x));
    }
    return 0;
}