#include<iostream>
#include<set>
#include<vector>
#include<cstdio>
using namespace std;
const int maxn = 10005;
set<int> G[maxn];
bool marked[maxn]{
0 };
int component = 0, depth = 0, max_depth = 0, cur_root;
set<int> deepest, deepest1;
void dfs_s(int v, set<int> &deepest<
1021 Deepest Root (25 分)c++实现【已AC】
最新推荐文章于 2022-03-02 00:07:12 发布