单点修改、区间查询
直接在原数组上用树状数组修改单点,查询区间 [l,r] [ l , r ] 的和即 [1,r]−[1,l) [ 1 , r ] − [ 1 , l )
区间修改、单点查询
设 ci=ai−ai−1 c i = a i − a i − 1 ,则 ai=∑ij=1cj a i = ∑ j = 1 i c j ,用树状数组维护 {ci} { c i } ,每当时区间 [l,r] [ l , r ] 加上 Δx Δ x 时, cl c l 加上 Δx Δ x , cr+1 c r + 1 减去 Δx Δ x ;查询 ai a i 的值时,求 ci c i 的前缀和即可。
区间修改、区间查询
看似是不可能实现的,
首先,要查询区间和,只要求出前缀和然后相减即可。
Code
/**************************
Au: Hany01
Date: Dec 28th, 2017
Prob: BIT 区间修改&区间查询
Email: hany01@foxmail.com
**************************/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Ha (1000000007)
#define lb(x) ((x) & -(x))
template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }
inline int read()
{
register int _, __; register char c_;
for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
return _ * __;
}
const int maxn = 1000001;
int n;
ll c[maxn], c1[maxn];
inline void Update(ll *c, int pos, ll dt) { for (register int i = pos; i <= n; i += lb(i)) c[i] += dt; }
inline ll Query(ll *c, int pos) { ll Sum = 0; for (register int i = pos; i; i -= lb(i)) Sum += c[i]; return Sum; }
int main()
{
register int m, type, x, y, t = 0;
register ll a[2] = {0}, k, tmp;
n = read(); m = read();
For(i, 1, n)
{
t ^= 1, a[t] = read();
tmp = a[t] - a[t ^ 1];
for (register int j = i; j <= n; j += lb(j)) c[j] += tmp;
tmp *= i;
for (register int j = i; j <= n; j += lb(j)) c1[j] += tmp;
}
while (m --)
{
type = read(), x = read(), y = read();
if (type == 1) {
k = read(),
Update(c, x, k), Update(c1, x, k * x),
Update(c, y + 1, -k), Update(c1, y + 1, -k * (y + 1));
} else
printf("%lld\n", ((y + 1) * Query(c, y) - Query(c1, y)) - (x * Query(c, x - 1) - Query(c1, x - 1)));
}
return 0;
}
//平沙芳草渡头村。绿遍去年痕。
// -- 洪咨夔《眼儿媚·平沙芳草渡头村》