(int jobl, int jobr, int l, int r, int i)
| 181 | } |
| 182 | |
| 183 | public static int query(int jobl, int jobr, int l, int r, int i) { |
| 184 | if (jobl <= l && r <= jobr) { |
| 185 | return minv[i]; |
| 186 | } |
| 187 | int mid = (l + r) / 2; |
| 188 | int ans = INF; |
| 189 | if (jobl <= mid) { |
| 190 | ans = Math.min(ans, query(jobl, jobr, l, mid, i << 1)); |
| 191 | } |
| 192 | if (jobr > mid) { |
| 193 | ans = Math.min(ans, query(jobl, jobr, mid + 1, r, i << 1 | 1)); |
| 194 | } |
| 195 | return ans; |
| 196 | } |
| 197 | |
| 198 | public static int pathMin(int x, int y) { |
| 199 | int ans = INF; |