To be an ACMan

边双连通分量求解要点：1.通过割点找变双连通分量。2.点入栈，当前边（u->v）的v点等于栈顶的点时停止出栈。3.每个割点可能属于多个连通分量。G++ AC，哪位大神帮忙改成C++ ACView Code #include<stdio.h>#include<string.h>#include<algorithm>#include<vector>using namespace std;#define maxn 1010#define maxm 1000009bool map[maxn][maxn];int min(int a, int b) Read More