#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int maxn=200005;
int n,m,fa[maxn][25],deep[maxn];
int root;
vector<int>g[maxn];
void dfs(int i)//算fa数组和deep
{
for(int k=1;k<=21;k++)
if(deep[i]>(1<<k))
fa[i]
倍增lca
最新推荐文章于 2023-12-12 16:12:59 发布