diff options
| -rw-r--r-- | datastructures/lazyPropagation1.cpp | 4 | ||||
| -rw-r--r-- | datastructures/lazyPropagation2.cpp | 4 | ||||
| -rw-r--r-- | tcr.pdf | bin | 646379 -> 646378 bytes |
3 files changed, 4 insertions, 4 deletions
diff --git a/datastructures/lazyPropagation1.cpp b/datastructures/lazyPropagation1.cpp index 13359b3..c1ffcf0 100644 --- a/datastructures/lazyPropagation1.cpp +++ b/datastructures/lazyPropagation1.cpp @@ -24,7 +24,7 @@ void push(int p) { d[i] = updateFlag; }}} -void update(int l, int r, ll value) { // add value +void update(int l, int r, ll value) { // data[l..r)+=value l += sz(tree)/2, r += sz(tree)/2; int l0 = l, r0 = r; for (; l < r; l /= 2, r /= 2) { @@ -35,7 +35,7 @@ void update(int l, int r, ll value) { // add value build(r0 - 1); } -ll query(int l, int r) { // max(l..r) +ll query(int l, int r) { // max[l..r) l += sz(tree)/2, r += sz(tree)/2; push(l); push(r - 1); diff --git a/datastructures/lazyPropagation2.cpp b/datastructures/lazyPropagation2.cpp index 6529102..b44b362 100644 --- a/datastructures/lazyPropagation2.cpp +++ b/datastructures/lazyPropagation2.cpp @@ -25,7 +25,7 @@ void push(int p) { d[i] = updateFlag; }}} -void update(int l, int r, ll value) { // assign value +void update(int l, int r, ll value) { // data[l..r)=value if (value == updateFlag) return; l += sz(tree)/2, r += sz(tree)/2; push(l); @@ -39,7 +39,7 @@ void update(int l, int r, ll value) { // assign value build(r0 - 1); } -ll query(int l, int r) { // sum(l..r) +ll query(int l, int r) { // sum[l..r) l += sz(tree)/2, r += sz(tree)/2; push(l); push(r - 1); Binary files differ |