题目: 传送门
改进: 相较于单点更新,引入lazy数组,lazy[node] = val表示当前节点(node)维护的子区间全部都要加上val(可正可负)。lazy标记在区间更新和区间查询时下传(push_down)
注意: 这里lazy标记不表示其所在节点的修改(仅表示其子节点的修改)
Code:
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 100010;
int arr[N];
struct Node {
int l, r;
LL sum, lazy;
}tr[4*N];
void pushup(int u) {
tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}
void pushdown(int u) {
Node &t = tr[u], < = tr[u << 1], &rt = tr[u << 1 | 1];
if (t.lazy) {
lt.lazy += t.lazy; lt.sum += t.lazy * (lt.r - lt.l + 1);
rt.lazy += t.lazy; rt.sum += t.lazy * (rt.r - rt.l + 1);
t.lazy = 0;
}
}
void build(int u, int l, int r) {
if (l == r) {
tr[u] = {l, r, arr[l], 0};
return;
} else {
tr[u].l = l; tr[u].r = r;
int mid = l + r >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid+1, r);
pushup(u);
}
}
void modify(int u, int l, int r, int x) {
if (l <= tr[u].l && tr[u].r <= r) {
tr[u].sum += (LL)(tr[u].r- tr[u].l + 1) * x;
tr[u].lazy += x;
return;
} else {
int mid = tr[u].l + tr[u].r >> 1;
pushdown(u);
if (l <= mid) modify(u << 1, l, r, x);
if (r > mid) modify(u << 1 | 1, l, r, x);
pushup(u);
}
}
LL query(int u, int l, int r) {
if (l <= tr[u].l && tr[u].r <= r) return tr[u].sum;
else {
int mid = tr[u].l + tr[u].r >> 1;
LL ans = 0;
pushdown(u);
if (l <= mid) ans += query(u << 1, l, r);
if (r > mid) ans += query(u << 1 | 1, l, r);
return ans;
}
}
int main() {
int n, m;
char op[2];
int l, r, d;
scanf("%d%d", &n, &m);
for (int i=1;i<=n;i++) scanf("%d", &arr[i]);
build(1, 1, n);
while (m--) {
scanf("%s", op);
if (*op == 'C') {
scanf("%d%d%d", &l, &r, &d);
modify(1, l, r, d);
} else {
scanf("%d%d", &l, &r);
printf("%lld\n", query(1, l, r));
}
}
return 0;
}