(int jobl, int jobr, int jobv, int l, int r, int i)
| 208 | } |
| 209 | |
| 210 | public static void add(int jobl, int jobr, int jobv, int l, int r, int i) { |
| 211 | if (jobl <= l && r <= jobr) { |
| 212 | lazy(i, jobv); |
| 213 | } else { |
| 214 | down(i); |
| 215 | int mid = (l + r) / 2; |
| 216 | if (jobl <= mid) { |
| 217 | add(jobl, jobr, jobv, l, mid, i << 1); |
| 218 | } |
| 219 | if (jobr > mid) { |
| 220 | add(jobl, jobr, jobv, mid + 1, r, i << 1 | 1); |
| 221 | } |
| 222 | up(i); |
| 223 | } |
| 224 | } |
| 225 | |
| 226 | // ans[0] : 线段树更左侧部分的max |
| 227 | // ans[1] : 线段树更左侧部分的min |