1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 50;
int n, m, a[maxn];
struct {
int l, r;
ll sum, tag;
#define l(x) tr[x].l
#define r(x) tr[x].r
#define sum(x) tr[x].sum
#define tag(x) tr[x].tag
} tr[4 * maxn];
void build(int p, int l, int r) {
l(p) = l, r(p) = r;
if (l == r) {
sum(p) = a[l];
return;
}
int mid = (l + r) / 2;
build(p * 2, l, mid), build(p * 2 + 1, mid + 1, r);
sum(p) = sum(p * 2) + sum(p * 2 + 1);
}
void down(int p) {
if (tag(p)) {
sum(p * 2) += tag(p) * (r(p * 2) - l(p * 2) + 1);
sum(p * 2 + 1) += tag(p) * (r(p * 2 + 1) - l(p * 2 + 1) + 1);
tag(p * 2) += tag(p), tag(p * 2 + 1) += tag(p);
tag(p) = 0;
}
}
void update(int p, int l, int r, int k) {
if (l <= l(p) && r(p) <= r) {
sum(p) += (ll)k * (r(p) - l(p) + 1);
tag(p) += k;
return;
}
down(p);
int mid = (l(p) + r(p)) / 2;
if (l <= mid) update(p * 2, l, r, k);
if (r > mid) update(p * 2 + 1, l, r, k);
sum(p) = sum(p * 2) + sum(p * 2 + 1);
}
ll ask(int p, int l, int r) {
if (l <= l(p) && r(p) <= r) return sum(p);
down(p);
int mid = (l(p) + r(p)) / 2;
ll ans = 0;
if (l <= mid) ans += ask(p * 2, l, r);
if (r > mid) ans += ask(p * 2 + 1, l, r);
return ans;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
build(1, 1, n);
int opt, x, y, k;
while (m--) {
scanf("%d", &opt);
if (opt == 1) {
scanf("%d%d%d", &x, &y, &k);
update(1, x, y, k);
} else {
scanf("%d%d", &x, &y);
printf("%lld\n", ask(1, x, y));
}
}
return 0;
}
|