Merge pull request #4099 from SansPapyrus683/master

bugs me tbh

Author: SansPapyrus683

content/4_Gold/PURS.mdx

@@ -87,6 +87,7 @@ They will be covered in [platinum](/plat/seg-ext).
 ```cpp
 #include <algorithm>
 #include <iostream>
+#include <limits>
 #include <vector>
 
 using std::cout;
@@ -96,7 +97,7 @@ using std::vector;
 /** A data structure that can answer point update & range minimum queries. */
 template <class T> class MinSegmentTree {
   private:
-	const T DEFAULT = 1e18;  // Will overflow if T is an int
+	const T DEFAULT = std::numeric_limits<T>().max();
 
 	vector<T> segtree;
 	int len;
@@ -115,12 +116,12 @@ template <class T> class MinSegmentTree {
 
 	/** @return the minimum element in the range [start, end) */
 	T range_min(int start, int end) {
-		T sum = DEFAULT;
+		T min = DEFAULT;
 		for (start += len, end += len; start < end; start /= 2, end /= 2) {
-			if (start % 2 == 1) { sum = std::min(sum, segtree[start++]); }
-			if (end % 2 == 1) { sum = std::min(sum, segtree[--end]); }
+			if (start % 2 == 1) { min = std::min(min, segtree[start++]); }
+			if (end % 2 == 1) { min = std::min(min, segtree[--end]); }
 		}
-		return sum;
+		return min;
 	}
 };
 
@@ -283,6 +284,7 @@ using std::cout;
 using std::endl;
 using std::vector;
 
+// BeginCodeSnip{Segment Tree}
 template <class T> class SumSegmentTree {
   private:
 	const T DEFAULT = 0;
@@ -310,6 +312,7 @@ template <class T> class SumSegmentTree {
 		return sum;
 	}
 };
+// EndCodeSnip
 
 int main() {
 	int arr_len;
@@ -406,6 +409,7 @@ Compared to the previous problem, all we need to change is the way we aggregate
 values (from `min()` to '+'), and change the initial value to 0.
 
 ```py
+# BeginCodeSnip{Segment Tree}
 class SumSegmentTree:
 	def __init__(self, len_: int):
 		self.len = len_
@@ -436,6 +440,9 @@ class SumSegmentTree:
 		return total
 
 
+# EndCodeSnip
+
+
 arr_len, query_num = map(int, input().split())
 arr = list(map(int, input().split()))