We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3c99182 commit 75aa1f3Copy full SHA for 75aa1f3
library/data_structures_[l,r]/lazy_seg_tree.hpp
@@ -1,7 +1,7 @@
1
#pragma once
2
#include "seg_tree_midpoint.hpp"
3
+ll op(ll vl, ll vr) { return vl + vr; }
4
struct seg_tree {
- ll op(ll vl, ll vr) { return vl + vr; }
5
int n;
6
vector<ll> tree, lazy;
7
seg_tree(int n): n(n), tree(2 * n), lazy(n) {}
0 commit comments