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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
typedef long long ll;
struct {
int left, right;
ll lazy;
ll len;
ll sum;
};
SeTreeNode tree[400000];
ll a[100010];
void build(int id, int l, int r);
void update(int id, int l, int r, ll val);
void PushDown(int id);
ll query(int id, int l, int r);
int main()
{
int T, n, a1, a2, q;
ll a3;
char s[12];
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
build(1, 1, n);
while (q--) {
scanf(" %s", s);
scanf("%d%d", &a1, &a2);
if (s[0] == 'Q') {
ll ans = query(1, a1, a2);
printf("%lldn", ans);
}
if (s[0] == 'C') {
scanf("%lld", &a3);
update(1, a1, a2, a3);
}
}
return 0;
}
void build(int id, int l, int r)
{
tree[id].left = l, tree[id].right = r;
tree[id].len = tree[id].right - tree[id].left + 1;
tree[id].lazy = 0;
if (tree[id].left == tree[id].right) {
tree[id].sum = a[l];
return;
}
int mid = (l + r) / 2;
build(id * 2, l, mid);
build(id * 2 + 1, mid + 1, r);
tree[id].sum = tree[id * 2].sum + tree[id * 2 + 1].sum;
}
ll query(int id, int l, int r)
{
if (tree[id].left >= l && tree[id].right <= r)
return tree[id].sum;
if (tree[id].left > r || tree[id].right < l)
return 0;
if (tree[id].lazy)
PushDown(id);
return query(id * 2, l, r) + query(id * 2 + 1, l, r);
}
void update(int id, int l, int r, ll val)
{
if (tree[id].left >= l && tree[id].right <= r) {
tree[id].sum += val * tree[id].len;
tree[id].lazy += val;
return;
}
if (tree[id].left > r || tree[id].right < l)
return;
if (tree[id].lazy)
PushDown(id);
update(id * 2 + 1, l, r, val);
update(id * 2, l, r, val);
tree[id].sum = tree[id * 2].sum + tree[id * 2 + 1].sum;
}
void PushDown(int id)
{
if (tree[id].lazy) {
tree[id * 2].lazy += tree[id].lazy;
tree[id * 2 + 1].lazy += tree[id].lazy;
tree[id * 2].sum += tree[id].lazy * tree[id * 2].len;
tree[id * 2 + 1].sum += tree[id].lazy * tree[id * 2 + 1].len;
tree[id].lazy = 0;
}
}
|
近期评论