高级数据结构：树状数组

---

#写在前面

https://baike.baidu.com/item/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84/313739?fr=aladdin

int lowbit(int x){
    return x&-x;
}

void add(int x, int c){ // x位置加c
    for(int i=x; i<=n; i+=lowbit(i))tr[i]+=c;
}

int sum(int x){ // 1-x的和
    int res=0;
    for(int i=x; i; i-=lowbit(i))res+=tr[i];
    return res;
}

##楼兰图腾

https://www.acwing.com/problem/content/243/

知道一个点左边有多少大于他的，右边有多少大于他的，乘起来就是V的个数

----c++版

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;

typedef long long ll;

const int N=200010;
int n;
int a[N];
int tr[N];//树状数组相当于桶排序中的桶
int Greater[N], lower[N];

int lowbit(int x){
    return x&-x;
}

void add(int x, int c){
    for(int i=x; i<=n; i+=lowbit(i))tr[i]+=c;
}

int sum(int x){
    int res=0;
    for(int i=x; i; i-=lowbit(i))res+=tr[i];
    return res;
}

int main(){
    scanf("%d", &n);
    
    for(int i=1; i<=n; i++)scanf("%d", &a[i]);
    
    for(int i=1; i<=n; i++){
        int y=a[i];
        Greater[i]=sum(n)-sum(y); //1到i-1中有几个数比y大
        lower[i]=sum(y-1);//1到i-1有几个数比y小
        add(y, 1);//数字y出现一次
    }
    
    memset(tr, 0, sizeof tr);//关键一步，左边的已经求完了，现在目的是求右边部分的数字统计
    ll res1=0, res2=0;
    for(int i=n; i; i--){
        int y=a[i];
        res1+=Greater[i]*(ll)(sum(n)-sum(y));//此时的sum公式指右边的数中有几个比y大的
        res2+=lower[i]*(ll)(sum(y-1));
        add(y, 1);
    }
    printf("%lld %lld\n", res1, res2);
    return 0;
}

##一个简单的整数问题

https://www.acwing.com/problem/content/248/
差分树状数组

对原数组进行区间加法，输出原数组的值

----c++版

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;

typedef long long ll;
const int N=100010;

int n,m;
int a[N];
ll tr[N];

int lowbit(int x){
    return x&-x;
}

void add(int x, int c){
    for(int i=x; i<=n; i+=lowbit(i))tr[i]+=c;
}

ll sum(int x){
    ll res=0; 
    for(int i=x; i; i-=lowbit(i))res+=tr[i];
    return res;
}

int main(){
    scanf("%d%d", &n, &m);
    for(int i=1; i<=n; i++)scanf("%d", &a[i]);
    
    for(int i=1; i<=n; i++)add(i, a[i]-a[i-1]);//差分树状数组
    
    while(m--){
        char op[2];
        int l, r, d;
        scanf("%s%d", op, &l);
        if(*op=='C'){
            scanf("%d%d", &r, &d);
            add(l, d); add(r+1, -d);//差分的点操作为原数组的区间操作
        }else{
            printf("%lld\n", sum(l));//输出原数组
        }
    }
    
    return 0;
}

##一个简单的整数问题2

https://www.acwing.com/problem/content/244/

对原数组进行区间加法，输出原数组的区间和

----c++版

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>

using namespace std;
typedef long long ll;
const int N=100010;

int n,m;
int a[N];
ll tr1[N]; //维护差分数组以求原数组
ll tr2[N]; //维护b[i]*i的前缀和

int lowbit(int x){
    return x&-x;
}

void add(ll tr[], int x, ll c){
    for (int i=x; i<=n; i+=lowbit(i)) tr[i]+=c;
}

ll sum(ll tr[], int x){
    ll res=0; 
    for(int i=x; i; i-=lowbit(i))res+=tr[i];
    return res;
}

ll prefix_sum(int x){
    return sum(tr1, x)*(x+1)-sum(tr2, x);
}

int main(){
    scanf("%d%d", &n, &m);
    for(int i=1; i<=n; i++)scanf("%d", &a[i]);
    for(int i=1; i<=n; i++){
        int b=a[i]-a[i-1];
        add(tr1,i, b);
        add(tr2, i, (ll)b*i);
    }
    
    while(m--){
        char op[2];
        int l,r,d;
        scanf("%s%d%d", op,&l, &r);
        if(*op=='Q'){
            printf("%lld\n", prefix_sum(r)-prefix_sum(l-1));
        }else{
            scanf("%d", &d);
            add(tr1, l, d), add(tr2, l, l*d);
            add(tr1, r+1, -d), add(tr2, r+1, (r+1)*-d);
        }
    }
    
    return 0;
}

##谜一样的牛

https://www.acwing.com/problem/content/245/

----c++版

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
const int N=100010;

int n;
int h[N];
int ans[N];
int tr[N];

int lowbit(int x){
    return x&-x;
}

void add(int x, int c){
    for(int i=x; i<=n; i+=lowbit(i))tr[i]+=c;
}

int sum(int x){
    int res=0;
    for(int i=x; i; i-=lowbit(i))res+=tr[i];
    return res;
}

int main(){
    scanf("%d", &n);
    for(int i=2; i<=n; i++)scanf("%d", &h[i]);
    for(int i=1; i<=n; i++)tr[i]=lowbit(i);
    
    for(int i=n; i; i--){
        int k=h[i]+1;
        int l=1, r=n;
        while(l<r){
            int mid=l+r>>1;
            if(sum(mid)>=k)r=mid;
            else l=mid+1;
        }
        ans[i]=r;
        add(r, -1);
    }
    
    for(int i=1; i<=n; i++)printf("%d\n", ans[i]);
    return 0;
}