(int a, int b)
| 74 | } |
| 75 | |
| 76 | public static int lca(int a, int b) { |
| 77 | if (deep[a] < deep[b]) { |
| 78 | int tmp = a; |
| 79 | a = b; |
| 80 | b = tmp; |
| 81 | } |
| 82 | for (int p = power; p >= 0; p--) { |
| 83 | if (deep[stjump[a][p]] >= deep[b]) { |
| 84 | a = stjump[a][p]; |
| 85 | } |
| 86 | } |
| 87 | if (a == b) { |
| 88 | return a; |
| 89 | } |
| 90 | for (int p = power; p >= 0; p--) { |
| 91 | if (stjump[a][p] != stjump[b][p]) { |
| 92 | a = stjump[a][p]; |
| 93 | b = stjump[b][p]; |
| 94 | } |
| 95 | } |
| 96 | return stjump[a][0]; |
| 97 | } |
| 98 | |
| 99 | public static void dfs2(int u, int f) { |
| 100 | for (int e = head[u], v; e != 0; e = next[e]) { |