a/Library
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Update segment_tree_v3.cpp

Browse source
This commit is contained in:
Anthony Wang 2020-04-27 13:03:28 -05:00
parent 573198e9da
commit 5faf4e7142
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
Data Structures/segment_tree_v3.cpp
View file

@ -1,5 +1,5 @@
int seg[400004], tmp[400004];
inline void pull(int n) { seg[n] = seg[n << 1] + seg[n << 1 | 1]; }
inline int pull(const int& l, const int& r) { return l + r; }
inline void push(int l, int r, int n) {
seg[n] += (r - l + 1) * tmp[n];
if (l != r) tmp[n << 1] += tmp[n], tmp[n << 1 | 1] += tmp[n];
@ -16,7 +16,7 @@ void update(int a, int b, int v, int l = 0, int r = -1, int n = 1) {
else {
int m = (l + r) >> 1;
update(a, b, v, l, m, n << 1), update(a, b, v, m + 1, r, n << 1 | 1);
pull(n);
seg[n] = pull(seg[n << 1], seg[n << 1 | 1]);
}
}
int query(int a, int b, int l = 0, int r = -1, int n = 1) {
@ -25,5 +25,5 @@ int query(int a, int b, int l = 0, int r = -1, int n = 1) {
if (tmp[n]) push(l, r, n);
if (l >= a && r <= b) return seg[n];
int m = (l + r) >> 1;
return query(a, b, l, m, n << 1) + query(a, b, m + 1, r, n << 1 | 1);
return pull(query(a, b, l, m, n << 1), query(a, b, m + 1, r, n << 1 | 1));
}