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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
| struct SegTree {
struct Node {
int l, r;
int sum, mx, mn;
int lazyAdd, lazyAssign;
bool hasAssign;
};
int n;
vector<Node> tr;
SegTree(int _n = 0) {
init(_n);
}
void init(int _n) {
n = _n, tr.assign(4 * n + 10, {});
if (n > 0)
build(1, 1, n);
}
void buildFrom(const vector<int>& a) {
if (a.size() < n + 1) {
vector<int> b(n + 1, 0);
for (int i = 1; i <= n; i++)
if (i < a.size())
b[i] = a[i];
build(1, 1, n, b);
}
else
build(1, 1, n, a);
}
void rangeAdd(int L, int R, int v) {
if (L > R)
return;
rangeAdd(1, L, R, v);
}
void rangeAssign(int L, int R, int v) {
if (L > R)
return;
rangeAssign(1, L, R, v);
}
int querySum(int L, int R) {
if (L > R)
return 0;
return querySum(1, L, R);
}
int queryMax(int L, int R) {
if (L > R)
return LONG_LONG_MIN;
return queryMax(1, L, R);
}
int queryMin(int L, int R) {
if (L > R)
return LONG_LONG_MAX;
return queryMin(1, L, R);
}
private:
inline void pushUp(int u) {
tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
tr[u].mx = max(tr[u << 1].mx, tr[u << 1 | 1].mx);
tr[u].mn = min(tr[u << 1].mn, tr[u << 1 | 1].mn);
}
inline void applyAssign(int u, int v) {
tr[u].hasAssign = true;
tr[u].lazyAssign = v;
tr[u].lazyAdd = 0;
int len = tr[u].r - tr[u].l + 1;
tr[u].sum = v * len;
tr[u].mx = tr[u].mn = v;
}
inline void applyAdd(int u, int v) {
if (tr[u].hasAssign)
tr[u].lazyAssign += v;
else
tr[u].lazyAdd += v;
int len = tr[u].r - tr[u].l + 1;
tr[u].sum += v * len;
tr[u].mx += v;
tr[u].mn += v;
}
inline void pushDown(int u) {
if (tr[u].hasAssign) {
applyAssign(u << 1, tr[u].lazyAssign);
applyAssign(u << 1 | 1, tr[u].lazyAssign);
tr[u].hasAssign = false;
}
if (tr[u].lazyAdd != 0) {
applyAdd(u << 1, tr[u].lazyAdd);
applyAdd(u << 1 | 1, tr[u].lazyAdd);
tr[u].lazyAdd = 0;
}
}
void build(int u, int l, int r) {
tr[u].l = l, tr[u].r = r;
tr[u].lazyAdd = 0; tr[u].hasAssign = false;
if (l == r) {
tr[u].sum = 0;
tr[u].mx = LONG_LONG_MIN, tr[u].mn = LONG_LONG_MAX;
return;
}
int mid = l + r >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid+1, r);
pushUp(u);
}
void build(int u, int l, int r, const vector<int>& a) {
tr[u].l = l, tr[u].r = r;
tr[u].lazyAdd = 0; tr[u].hasAssign = false;
if (l == r) {
tr[u].sum = a[l], tr[u].mx = a[l], tr[u].mn = a[l];
return;
}
int mid = l + r >> 1;
build(u << 1, l, mid, a);
build(u << 1 | 1, mid+1, r, a);
pushUp(u);
}
void rangeAssign(int u, int L, int R, int v) {
if (L <= tr[u].l && tr[u].r <= R) {
applyAssign(u, v);
return;
}
pushDown(u);
int mid = (tr[u].l + tr[u].r) >> 1;
if (L <= mid)
rangeAssign(u << 1, L, R, v);
if (mid < R)
rangeAssign(u << 1 | 1, L, R, v);
pushUp(u);
}
void rangeAdd(int u, int L, int R, int v) {
if (L <= tr[u].l && tr[u].r <= R) {
applyAdd(u, v);
return;
}
pushDown(u);
int mid = (tr[u].l + tr[u].r) >> 1;
if (L <= mid)
rangeAdd(u << 1, L, R, v);
if (mid < R)
rangeAdd(u << 1 | 1, L, R, v);
pushUp(u);
}
int querySum(int u, int L, int R) {
if (L <= tr[u].l && tr[u].r <= R) return tr[u].sum;
pushDown(u);
int mid = (tr[u].l + tr[u].r) >> 1;
int res = 0;
if (L <= mid)
res += querySum(u << 1, L, R);
if (mid < R)
res += querySum(u << 1 | 1, L, R);
return res;
}
int queryMax(int u, int L, int R) {
if (L <= tr[u].l && tr[u].r <= R)
return tr[u].mx;
pushDown(u);
int mid = (tr[u].l + tr[u].r) >> 1;
int res = LONG_LONG_MIN;
if (L <= mid)
res = max(res, queryMax(u << 1, L, R));
if (mid < R)
res = max(res, queryMax(u << 1 | 1, L, R));
return res;
}
int queryMin(int u, int L, int R) {
if (L <= tr[u].l && tr[u].r <= R)
return tr[u].mn;
pushDown(u);
int mid = (tr[u].l + tr[u].r) >> 1;
int res = LONG_LONG_MAX;
if (L <= mid)
res = min(res, queryMin(u << 1, L, R));
if (mid < R)
res = min(res, queryMin(u << 1 | 1, L, R));
return res;
}
};
|
