pre { white-space: pre !important; word-wrap: normal !important; overflow-x: auto !important; display: block !important; font-family: "Consolas", "Monaco", "Courier New", …
倍增法lca
const int N = 500010;
int n, m, s;
vector<int> g[N];
void addeg(int u, int v) {g[u].push_back(v);g[v].push_back(u);
}int d[N], anc[N][25];
void dfs(int u, int fa) {d[u] = d[fa] + 1;for …
pre { white-space: pre !important; word-wrap: normal !important; overflow-x: auto !important; display: block !important; font-family: "Consolas", "Monaco", "Courier New", …