原题传送门
#include <bits/stdc++.h>
using namespace std;
int c[100005];
int a[100005];
int n;
int lowbit(int x)
{
return x & (-x);
}
int Sum(int i)
{
int res = 0;
while (i > 0)
{
res += c[i];
i -= lowbit(i);
}
return res;
}
void Add(int i, int k)
{
while (i <= n)
{
c[i] += k;
i += lowbit(i);
}
}
int main()
{
cin >> n;
int w;
cin >> w;
while (w--)
{
char in;
cin >> in;
int a, b;
cin >> a >> b;
if (in == 'x')
{
Add(a, b);
}
else
{
cout << Sum(b) - Sum(a - 1) << endl;
}
}
}
树状数组模板
红线表示着和的关系,如C4=C2+C3+A4
存在规律
C
[
i
]
=
A
[
i
−
2
k
+
1
]
+
A
[
i
−
2
k
+
2
]
+
.
.
.
+
A
[
i
]
C[i] = A[i - 2^k+1] + A[i - 2^k+2] + ... + A[i]
C[i]=A[i−2k+1]+A[i−2k+2]+...+A[i]
k
k
k 为
i
i
i 的二进制中从最低位到高位连续零的长度
因此有
s
u
m
[
i
]
=
C
[
i
]
+
C
[
i
−
2
k
1
]
+
C
[
(
i
−
2
k
1
)
−
2
k
2
]
+
.
.
.
sum[i]= C[i] + C[i-2^{k_1}] + C[(i - 2^{k_1}) - 2^{k_2}] + ...
sum[i]=C[i]+C[i−2k1]+C[(i−2k1)−2k2]+...
又由于
l
o
w
b
i
t
(
x
)
=
x
&
(
−
x
)
=
2
k
lowbit(x)=x\&(-x)=2^k
lowbit(x)=x&(−x)=2k
于是
int Sum(int i)//返回sum[i]
{
int res = 0;
while (i > 0)
{
res += c[i];
i -= lowbit(i);
}
return res;
}
同理,求和向下寻找子项,改变某一项则要向上寻找父节点,相当于Sum函数逆过程
void Add(int i, int k)
{
while (i <= n)
{
c[i] += k;
i += lowbit(i);
}
}