(long[] tree, int l, int r, int i)
| 95 | } |
| 96 | |
| 97 | public static void clear(long[] tree, int l, int r, int i) { |
| 98 | if (tree[i] == -INF) { |
| 99 | return; |
| 100 | } |
| 101 | tree[i] = -INF; |
| 102 | if (l < r) { |
| 103 | int mid = (l + r) >> 1; |
| 104 | clear(tree, l, mid, i << 1); |
| 105 | clear(tree, mid + 1, r, i << 1 | 1); |
| 106 | } |
| 107 | } |
| 108 | |
| 109 | public static void update(long[] tree, int jobi, long jobv, int l, int r, int i) { |
| 110 | if (l == r) { |