#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100010;
int n,m,a1,a2,in[maxn],out[maxn],head[maxn],ncnt,cnt,c[maxn],vis[maxn];
struct edge{
int to,ne;
}e[maxn];
inline int lowbit(int x){
return x&(x^(x-1));}
【Codevs1228】苹果树(dfs序+树状数组)
最新推荐文章于 2022-05-05 11:28:08 发布