This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub SSRS-cp/cp_library
//Range Update Range Min template <typename T> struct lazy_segment_tree{ int N; vector<T> ST; vector<T> lazy; lazy_segment_tree(int n){ N = 1; while (N < n){ N *= 2; } ST = vector<T>(N * 2 - 1, INF); lazy = vector<T>(N * 2 - 1, -1); } lazy_segment_tree(vector<T> A){ int n = A.size(); N = 1; while (N < n){ N *= 2; } ST = vector<T>(N * 2 - 1, INF); lazy = vector<T>(N * 2 - 1, -1); for (int i = 0; i < n; i++){ ST[N - 1 + i] = A[i]; } for (int i = N - 2; i >= 0; i--){ ST[i] = min(ST[i * 2 + 1], ST[i * 2 + 2]); } } void eval(int i){ if (lazy[i] != -1){ if (i < N - 1){ lazy[i * 2 + 1] = lazy[i]; lazy[i * 2 + 2] = lazy[i]; } ST[i] = lazy[i]; lazy[i] = -1; } } void range_update(int L, int R, T x, int i, int l, int r){ eval(i); if (R <= l || r <= L){ return; } else if (L <= l && r <= R){ lazy[i] = x; eval(i); } else { int m = (l + r) / 2; range_update(L, R, x, i * 2 + 1, l, m); range_update(L, R, x, i * 2 + 2, m, r); ST[i] = min(ST[i * 2 + 1], ST[i * 2 + 2]); } } void range_update(int L, int R, T x){ return range_update(L, R, x, 0, 0, N); } T range_min(int L, int R, int i, int l, int r){ eval(i); if (R <= l || r <= L){ return INF; } else if (L <= l && r <= R){ return ST[i]; } else { int m = (l + r) / 2; return min(range_min(L, R, i * 2 + 1, l, m), range_min(L, R, i * 2 + 2, m, r)); } } T range_min(int L, int R){ return range_min(L, R, 0, 0, N); } };
#line 1 "old_Range_Queries/Range_Update_Range_Min.cpp" //Range Update Range Min template <typename T> struct lazy_segment_tree{ int N; vector<T> ST; vector<T> lazy; lazy_segment_tree(int n){ N = 1; while (N < n){ N *= 2; } ST = vector<T>(N * 2 - 1, INF); lazy = vector<T>(N * 2 - 1, -1); } lazy_segment_tree(vector<T> A){ int n = A.size(); N = 1; while (N < n){ N *= 2; } ST = vector<T>(N * 2 - 1, INF); lazy = vector<T>(N * 2 - 1, -1); for (int i = 0; i < n; i++){ ST[N - 1 + i] = A[i]; } for (int i = N - 2; i >= 0; i--){ ST[i] = min(ST[i * 2 + 1], ST[i * 2 + 2]); } } void eval(int i){ if (lazy[i] != -1){ if (i < N - 1){ lazy[i * 2 + 1] = lazy[i]; lazy[i * 2 + 2] = lazy[i]; } ST[i] = lazy[i]; lazy[i] = -1; } } void range_update(int L, int R, T x, int i, int l, int r){ eval(i); if (R <= l || r <= L){ return; } else if (L <= l && r <= R){ lazy[i] = x; eval(i); } else { int m = (l + r) / 2; range_update(L, R, x, i * 2 + 1, l, m); range_update(L, R, x, i * 2 + 2, m, r); ST[i] = min(ST[i * 2 + 1], ST[i * 2 + 2]); } } void range_update(int L, int R, T x){ return range_update(L, R, x, 0, 0, N); } T range_min(int L, int R, int i, int l, int r){ eval(i); if (R <= l || r <= L){ return INF; } else if (L <= l && r <= R){ return ST[i]; } else { int m = (l + r) / 2; return min(range_min(L, R, i * 2 + 1, l, m), range_min(L, R, i * 2 + 2, m, r)); } } T range_min(int L, int R){ return range_min(L, R, 0, 0, N); } };