时间复杂度:O(nlogn)
作用:解决维护动态数组前缀和问题
可以发现如下规律:
1=(001) C[1] = A[1];
2=(010) C[2] = A[1] + A[2] = C[1] + A[2];
3=(011) C[3] = A[3];
4=(100) C[4] = A[1] + A[2] + A[3] + A[4] = C[2] + C[3] + A[4];
5=(101) C[5] = A[5];
6=(110) C[6] = A[5] + A[6] = C[5] + A[6];
7=(111) C[7] = A[7];
8=(1000) C[8] = A[1] + A[2] + A[3] + A[4] + A[5] + A[6] + A[7] + A[8] = C[4] + C[6] + C[7] + A[8];
C[i] = A[i-2^k+1] + A[i-2^k+2] + ...... + A[i];
其中k表示i的二进制末尾0的个数
整数在计算机中一般采用补码存储,把一个补码表示的整数x变成其相反数 -x 相当与把每一位都取反然后末位加一,等价于把x的二进制最右边的1左边的每一位都取反。因此 lowbit(x) 就是取 x 的二进制最右边的 1 和它右边所有的 0。
lowbit操作:
int lowbit(int x){
return x & (-x);
}
更新操作:
void update(int x, int num){
for(int i = x; i <= N; i += lowbit(i)){
tree[i] += num;
}
}
求和操作:
int getSum(int x){
int res = 0;
for(int i = x; i > 0; i -= lowbit(i)){
res += tree[i];
}
return res;
}
单点更新,区间查询
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 50005;
int tree[maxn];
int T, N;
int lowbit(int x){
return x & (-x);
}
void update(int x, int num){
for(int i = x; i <= N; i += lowbit(i)){
tree[i] += num;
}
}
int getSum(int x){
int res = 0;
for(int i = x; i > 0; i -= lowbit(i)){
res += tree[i];
}
return res;
}
int main()
{
cin >> T;
int cnt = 0;
while(T--){
cin >> N;
memset(tree, 0, sizeof tree);
int tmp;
for(int i = 1; i <= N; i++){
cin >> tmp;
update(i, tmp);
}
cout << "Case " << ++cnt << ':' << endl;
string s;
int x, y;
while(cin >> s && s[0] != 'E'){
if(s[0] == 'Q'){
cin >> x >> y;
cout << getSum(y) - getSum(x-1) << endl;
}
else if(s[0] == 'A'){
cin >> x >> y;
update(x, y);
}
else{
cin >> x >> y;
update(x, -y);
}
}
}
return 0;
}
区间更新,单点查询
例:洛谷P3368
利用差分的思想,新建一个数组 tree[i] = a[i] - a[i-1]
例如对于下面这个数组
- a[] = 1 2 3 5 6 9
- tree[] = 1 1 1 2 1 3
如果我们把[2,5]区间内值加上2,则变成了
- a[] = 1 4 5 7 8 9
- tree[] = 1 3 1 2 1 1
所以对 [x, y] 区间进行值的变化为 k,在差分数组中实际发生变化的只有 tree[x] 和 tree[y-1]
在 update 函数中传参为 update(x, k),update(y-1, -k)
#include <iostream>
using namespace std;
const int maxn = 5e5 + 7;
int tree[maxn];
int a[maxn];
int n, m;
int lowbit(int x){
return x & (-x);
}
void update(int i, int x){
for(int j = i; j <= n; j += lowbit(j)){
tree[j] += x;
}
}
int getSum(int i){
int res = 0;
for(int j = i; j >= 1; j -= lowbit(j)){
res += tree[j];
}
return res;
}
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> a[i];
update(i, a[i] - a[i-1]);
}
int c, x, y, k;
while(m--){
cin >> c;
if(c == 1){
cin >> x >> y >> k;
update(x, k);
update(y+1, -k);
}
else {
cin >> x;
cout << getSum(x) << endl;
}
}
return 0;
}
区间更新,区间查询
a[1] + a[2] + …… + a[n]
= tree[1] + (tree[1] + tree[2]) + (tree[1] + tree[2] + tree[3]) + …… + (tree[1] + tree[2] + …… + tree[n])
= n * (tree[1] + tree[2] + …… + tree[n]) - (0 * tree[1] + 1 * tree[2] + 2 * tree[3] + …… + (n - 1) * tree[n])
所以我们维护两个树状数组 tree1[i] = D[i],tree2[i] = D[i]*(i-1);
void update(int i, int x){
for(int j = i; j <= n; j += lowbit(j)){
tree1[j] += x;
tree2[j] += x * (i-1);
}
}
int getSum(int i){
int res = 0;
for(int j = i; j >= 1; j -= lowbit(j)){
res += i * tree1[j] - tree2[j];
}
return res;
}
例:POJ3468
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 7;
LL tree1[maxn], tree2[maxn], a[maxn];
int n, m;
int lowbit(int x){
return x & (-x);
}
void update(int i, LL x){
for(int j = i; j <= n; j += lowbit(j)){
tree1[j] += x;
tree2[j] += x * (i-1);
}
}
LL getSum(int i){
LL res = 0;
for(int j = i; j >= 1; j -= lowbit(j)){
res += i * tree1[j] - tree2[j];
}
return res;
}
int main()
{
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++){
scanf("%lld", &a[i]);
update(i, a[i] - a[i-1]);
}
char c;
int x, y, k;
while(m--){
scanf(" %c", &c);
if(c == 'C'){
scanf("%d %d %d", &x, &y, &k);
update(x, k);
update(y+1, -k);
}
else {
scanf("%d %d", &x, &y);
printf("%lld\n", getSum(y) - getSum(x-1));
}
}
return 0;
}