-
Notifications
You must be signed in to change notification settings - Fork 1
/
Range_Update_Add_Range_Sum.cpp
64 lines (64 loc) · 1.47 KB
/
Range_Update_Add_Range_Sum.cpp
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
//Range Update Add Range Sum
template <typename T>
struct lazy_segment_tree{
int N;
vector<T> ST;
vector<pair<int, T>> lazy;
lazy_segment_tree(){
}
lazy_segment_tree(int n){
N = 1;
while (N < n){
N *= 2;
}
ST = vector<T>(N * 2 - 1, 0);
lazy = vector<pair<int, T>>(N * 2 - 1, make_pair(1, 0));
}
void eval(int i, int l, int r){
if (i < N - 1){
if (lazy[i].first == 0){
lazy[i * 2 + 1] = lazy[i];
lazy[i * 2 + 2] = lazy[i];
} else {
lazy[i * 2 + 1].second += lazy[i].second;
lazy[i * 2 + 2].second += lazy[i].second;
}
}
ST[i] = ST[i] * lazy[i].first + lazy[i].second * (r - l);
lazy[i] = make_pair(1, 0);
}
void update(int L, int R, T x, int t, int i, int l, int r){
eval(i, l, r);
if (r <= L || R <= l){
return;
} else if (L <= l && r <= R){
lazy[i] = make_pair(t, x);
eval(i, l, r);
} else {
int m = (l + r) / 2;
update(L, R, x, t, i * 2 + 1, l, m);
update(L, R, x, t, i * 2 + 2, m, r);
ST[i] = ST[i * 2 + 1] + ST[i * 2 + 2];
}
}
void range_update(int L, int R, T x){
update(L, R, x, 0, 0, 0, N);
}
void range_add(int L, int R, T x){
update(L, R, x, 1, 0, 0, N);
}
T range_sum(int L, int R, int i, int l, int r){
eval(i, l, r);
if (r <= L || R <= l){
return 0;
} else if (L <= l && r <= R){
return ST[i];
} else {
int m = (l + r) / 2;
return range_sum(L, R, i * 2 + 1, l, m) + range_sum(L, R, i * 2 + 2, m, r);
}
}
T range_sum(int L, int R){
return range_sum(L, R, 0, 0, N);
}
};