(long[] tree, int l, int r, int i)
| 86 | } |
| 87 | |
| 88 | public static void build(long[] tree, int l, int r, int i) { |
| 89 | tree[i] = -INF; |
| 90 | if (l < r) { |
| 91 | int mid = (l + r) >> 1; |
| 92 | build(tree, l, mid, i << 1); |
| 93 | build(tree, mid + 1, r, i << 1 | 1); |
| 94 | } |
| 95 | } |
| 96 | |
| 97 | public static void clear(long[] tree, int l, int r, int i) { |
| 98 | if (tree[i] == -INF) { |