| 48 | pull(n); |
| 49 | } |
| 50 | int query(int n, int b, int e, int i, int j) { |
| 51 | push(n, b, e); |
| 52 | if (i > e || b > j) return inf; |
| 53 | if (i <= b && e <= j) return t[n]; |
| 54 | int mid = (b + e) >> 1; |
| 55 | return combine(query(lc, b, mid, i, j), query(rc, mid + 1, e, i, j)); |
| 56 | } |
| 57 | } t; |
| 58 | |
| 59 | // id of span {i, i} is i |