A798283635的博客

#include<bits/stdc++.h> #define maxn 10000+5 using namespace std; vector<int>mp[maxn]; int vis[maxn],dfn[maxn],low[maxn]; int n,m,cnt,sig; void init() { memset(low,0,sizeof(low)); memset(dfn,0,sizeof(dfn)); memset(vis,0,sizeof(vis)); for(i

1.求有向图强连通分量个数    1.1vector模板#include&lt;stdio.h&gt;//此代码仅供参考，用于求一个图存在多少个强连通分量 #include&lt;string.h&gt; #include&lt;vector&gt; #include&lt;algorithm&gt; using namespace std; #define maxn 10000+5 vector...

Problem DescriptionTo prove two sets A and B are equivalent, we can first prove A is a subset of B, and then prove B is a subset of A, so finally we got that these two sets are equivalent. You are to ...

#include <map> #include <set> #include <queue> #include <stack> #include <vector> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <algorith