ToheartZhang的博客

//top++ //强连通分量的数组要和点的数组一样大 #include<cstdio> #include<iostream> #include<vector> using namespace std; const int maxn = 5050; vector<int> g[5050]; int low[maxn], stack[maxn], instack[maxn], dfn[maxn],

//即求不为1的最小的强连通分量 #include<cstdio> #include<iostream> using namespace std; const int maxn = 200050; struct node{ int hou,ne; }g[maxn]; int stack[maxn],instack[maxn],dfn[maxn],low[maxn]; int top = 0