We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 525cde5 commit 611f33dCopy full SHA for 611f33d
library/data_structures_[l,r]/seg_tree.hpp
@@ -2,12 +2,11 @@
2
//! https://codeforces.com/blog/entry/118682
3
//! @code
4
//! {
5
-//! tree st(n, pii{}, [&](pii& l, pii& r) {
6
-//! return min(l, r);
+//! tree st(n, 0LL, [&](ll l, ll r) {
+//! return l + r;
7
//! });
8
//! }
9
-//! tree st(n, int{}, ranges::min);
10
-//! rep(i, 0, n) st.update(i, a[i]);
+//! tree st(n, INT_MAX, ranges::min);
11
//! @endcode
12
//! @time O(n + q log n)
13
//! @space O(n)
0 commit comments