(int x, int y, int v)
| 32 | public static int n, k; |
| 33 | |
| 34 | public static void update(int x, int y, int v) { |
| 35 | for (int i = x; i <= MAXH; i += i & -i) { |
| 36 | for (int j = y; j <= k + 1; j += j & -j) { |
| 37 | tree[i][j] = Math.max(tree[i][j], v); |
| 38 | } |
| 39 | } |
| 40 | } |
| 41 | |
| 42 | public static int max(int x, int y) { |
| 43 | int ans = 0; |