树状数组

树状数组可以在O(logn)的时间复杂度内求出前缀和||插入一个数

树状数组的三种基本模板

区间查询+单点修改 将a[i]最为树状数组中的每个元素
题目链接

#include<iostream>
#include<cstdio>

using namespace std;
int n,m;
const int N=1000010;
int tr[N];

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

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

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

int main(){
	cin>>n>>m;
	for (int i=1;i<=n;i++){
		int a;
		cin>>a;
		add(i,a);
	}
	for (int i=1;i<=m;i++){
		int a,b,c;
		cin>>a>>b>>c;
		if (a==1)
			add(b,c);
		else if (a==2)
			cout<<sum(c)-sum(b-1)<<endl;
	}
	return 0;
		
}

区间修改+单点查询 b[i]（差分）为树状数组中的每个元素
题目链接

#include<iostream>
#include<cstdio>
using namespace std;
const int N=500010;
int n,m;
int tr[N];
int a[N];

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

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

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



int main(){
	cin>>n>>m;
	for (int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		add(i,a[i]-a[i-1]);

	}
	while (m--){
		int op,x,y,k;
		cin>>op;
		if (op==1){
			cin>>x>>y>>k;
			add(x,k);add(y+1,-k);
		}

		else{
			cin>>x;
			cout<<sum(x)<<endl;
		}


	}

	return 0;
}

区间修改+区间查询 query=sum(tr1, x) * (x + 1) - sum(tr2, x)
tr1存储b[i]
tr2存储b[i]*i;

原题链接

#include<iostream>


using namespace std;
typedef long long ll;
const int N=100010;
int n,m;
ll a[N];
ll tr1[N];
ll tr2[N];

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

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

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

	return ans;

}

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


int main(){
	cin>>n>>m;
	for (int i=1;i<=n;i++){
		cin>>a[i];
		add(tr1,i,a[i]-a[i-1]);
		add(tr2,i,i*(a[i]-a[i-1]));
	}
	while (m--){
		char op[2];
		cin>>op;
		ll l,r,value;
		if (*op=='Q'){
			cin>>l>>r;
			cout<<get_sum(r)-get_sum(l-1)<<endl;

		}
		else{
			cin>>l>>r>>value;
			add(tr1,l,value);
			add(tr1,r+1,-value);
			add(tr2,l,value*l);
			add(tr2,r+1,-value*(r+1));
			
		}

	}

	return 0;
}