-
Notifications
You must be signed in to change notification settings - Fork 1
/
Range_Chmin_Range_Min.cpp
60 lines (60 loc) · 1.3 KB
/
Range_Chmin_Range_Min.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
//Range Chmin 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, INF);
}
void eval(int i){
if (i < N - 1){
lazy[i * 2 + 1] = min(lazy[i * 2 + 1], lazy[i]);
lazy[i * 2 + 2] = min(lazy[i * 2 + 2], lazy[i]);
}
ST[i] = min(ST[i], lazy[i]);
lazy[i] = INF;
}
void range_chmin(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_chmin(L, R, x, i * 2 + 1, l, m);
range_chmin(L, R, x, i * 2 + 2, m, r);
ST[i] = min(ST[i * 2 + 1], ST[i * 2 + 2]);
}
}
void range_chmin(int L, int R, T x){
return range_chmin(L, R, x, 0, 0, N);
}
void chmin(int k, T x){
return range_chmin(k, k + 1, x);
}
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);
}
T operator [](int k){
return range_min(k, k + 1);
}
};