树状数组（一维）

树状数组

细节

树状数组： （数据量很大，WA了多考虑long long）

差分：

单点修改 + 区间查询

单点修改和区间查：直接原数组a[i]+k 则所有包含a[i]的上层数组c[i]+k，区间查询用前缀和
#130. 树状数组 1 ：单点修改，区间查询

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 1e6+10;
ll a[maxn], c[maxn];
ll n, m;

inline ll read() {
	char c = getchar();
	ll x = 0, f = 1;
	while(c < '0' || c > '9') {	
		if(c == '-') f = -1;
		c =getchar();
	}
	while(c >= '0' && c <= '9') {
		x = x * 10 + c - '0';
		c = getchar();
	}
	return f*x;
}

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

void add(ll x, ll k) {
	while(x <= n) {
		c[x] += k;
		x += lowbit(x);
	}
}

ll getsum(ll x) {
	ll ans = 0;
	while(x >= 1) {
		ans += c[x];
		x -= lowbit(x);
	}
	return ans;
}

int main() {
	n = read(), m = read();
	for(ll i = 1; i <= n; i++) add(i,read());
	while(m--) {
		ll op, l, r;
		op = read(); l = read(); r = read();
		if(op == 1) {
			add(l, r); // a[l] + r
		}
		else if(op == 2) { // l~r 的和 
			printf("%lld\n", getsum(r)-getsum(l-1)); // 区间和用前缀和完成 
		}
	}
	return 0;
}

区间修改+单点查询

区间修改和单点查询：对于原数组a[]通过后项-前项构造一个差分数组，原数组区间修改相当于差分数组对应位置单点修改，单点查询相当于差分数组前缀和

#131. 树状数组 2 ：区间修改，单点查询

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e6+10;
int n, m;
ll c[maxn];

inline ll read() {
	char c = getchar(); int f = 1, x = 0;
	while(c < '0' || c > '9') {
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9'){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x*f;
}

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

void add(ll x, ll k) {
	while(x <= n) {
		c[x] += k;
		x += lowbit(x);
	}
}

ll query(ll x) {
	ll ans = 0;
	while(x >= 1) {
		ans += c[x];
		x -= lowbit(x);
	}
	return ans;
}

int main() {
	n = read();
	m = read();
	
	ll pre = 0, now;
	for(int i = 1; i <= n; i++) {
		now = read();
		add(i,now - pre);
		pre = now;
	}
	
	int op;
	while(m--) {
		op = read();
		if(op == 1) {
			ll l = read(), r = read(), k = read();
			add(l, k);
			add(r+1, -k); // 差分 
		}
		else if(op == 2) {
			ll x = read();
			printf("%lld\n", query(x));
		}
	}
	return 0;
} 

区间修改+区间查询

区间查询和区间修改：由于差分原理，我们准备两个数组，一个存 b[i]=a[i+1]-a[i],另一个存b[i]*i

#132. 树状数组 3 ：区间修改，区间查询

#include<iostream>
#include<cstring>
#include<cstdio>
#define ll long long
const int maxn = 1e6+10;
using namespace std;
long long c[maxn][2];
ll n, m;

inline ll read() {
	char c = getchar(); int f = 1, x = 0;
	while(c < '0' || c > '9') {
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9'){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x*f;
}

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

void add(ll x, ll k, int t) {
	while(x <= n) {
		c[x][t] += k;
		x += lowbit(x);
	}
}

ll query(ll x, int t) {
	ll res = 0;
	while(x > 0) {
		res += c[x][t];
		x -= lowbit(x);
	}
	return res;
}

ll ask(ll x) {
	ll res = (x+1)*query(x,0)-query(x,1);
	return res;
}

int main() {
	n = read();
	m = read();
	
	ll pre = 0, now;
	for(int i = 1; i <= n; i++) {
		now = read();
		add(i,now - pre, 0);
		add(i,i*(now - pre), 1);
		pre = now;
	}
	
	int op;
	while(m--) {
		op = read();
		if(op == 1) {
			ll l = read(), r = read(), k = read();
			add(l, k, 0);
			add(r+1, -k, 0); // 差分 
			add(l, l*k, 1);
			add(r+1, (r+1)*(-k), 1);
		}
		else if(op == 2) {
			ll l = read(), r = read();
			printf("%lld\n", ask(r)-ask(l-1));
		}
	}
	return 0;
}