qq_44866969的博客

#include<bits/stdc++.h>using namespace std;const int V=3e5+100;int dfn[V],low[V],parent[V];bool vis[V];vector<int> g[V];int cnt; int n,m;int a[V];void dfs(int u){ // 子树数量 int children = 0; // 默认low[u]等于dfn[u] dfn[u]=.

//minn为最小强连通分量的点数 #include<iostream>#include<bits/stdc++.h>using namespace std;const int maxn=2e5+5;vector<int> v[maxn];int dfn[maxn];int low[maxn];int cnt=0;int vis[maxn]; //1表示在栈中stack<int> s;int minn=0x3f3f3f3f; voi.