[OC]一本通提高算法之树状数组

A 树状数组 1 ：单点修改，区间查询

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e6;
int n,m;
ll sum[maxn];
int lowbit(int x) {
    return x&(-x);
}
void add(int x,ll val) {
    while(x<=maxn) {
        sum[x]+=val;
        x+=lowbit(x);
    }
}
ll getsum(int x) {
    ll res=0;
    while(x) {
        res+=sum[x];
        x-=lowbit(x);
    }
    return res;
}
int main() {
    scanf("%d%d",&n,&m);
    ll c;
    for(int i=1; i<=n; i++) {
        scanf("%lld",&c);
        add(i,c);
    }
    while(m--) {
        int id,x,y;
        scanf("%d%d%d",&id,&x,&y);
        if(id==1)add(x,y);
        else printf("%lld\n",getsum(y)-getsum(x-1));
    }
    return 0;
}

---

B 树状数组 2 ：区间修改，单点查询

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 4000010;
ll tree[N];
ll op, n, m, x, y, k, val;
ll lowbit(ll x) {
    return x & (-x);
}
void insert(ll i, ll k) {
    while (i <= n) {
        tree[i] += k;
        i += lowbit(i);
    }
}
void update(ll x, ll y, ll k) {
    insert(x, k), insert(y + 1, -k);
}
ll query(ll x) {
    ll sum = 0;
    while(x) {
        sum += tree[x];
        x -= lowbit(x);
    }
    return sum;
}
int main() {
    scanf("%lld%lld",&n,&m);
    for(int i = 1; i <= n; i ++) {
    scanf("%lld",&val);
        update(i, i, val);
    }
    while(m --) {
        scanf("%lld",&op);
        if(op == 1) {
            scanf("%lld%lld%lld",&x,&y,&k);
            update(x, y, k);
        } else {
            scanf("%lld",&x);
            printf("%lld\n",query(x));
        }
    }
    return 0;
}

---

C 树状数组 3 ：区间修改，区间查询

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn=1e6+10;
ll sum1[maxn],sum2[maxn],a[maxn];
int n,q;
int lowbit(int x){return x&(-x);}
void add(int x,ll val){
    for(int i=x;i<=n;i+=lowbit(i)){
        sum1[i]+=val;
        sum2[i]+=(x-1)*val;
    }
}
ll ask(int x){
    ll res=0;
    for(int i=x;i;i-=lowbit(i)){
        res+=x*sum1[i]-sum2[i];
    }
    return res;
}
int main(){
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
        add(i,a[i]-a[i-1]);
    }
    while(q--){
        int id,l,r,x;
        scanf("%d",&id);
        if(id==1){
            scanf("%d%d%d",&l,&r,&x);
            add(l,x); add(r+1,-x);
        }
        else{
            scanf("%d%d",&l,&r);
            printf("%lld\n",ask(r)-ask(l-1));
        }
    }
    return 0;
}

---

三联谢谢