摘要:
倍增法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]; v 阅读全文
摘要:
#include <bits/stdc++.h> using namespace std; using ull = unsigned long long; using ll = long long; const int N = 50010; int T; struct node { int l, r 阅读全文