![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
双联通分量
Keep_Trying_Go
无
展开
-
poj3177(双联通分量)
题意:就是在加多少边才能使这个图变成双联通图思路:利用dfs求出连通分量的个数ans,再将这些连通分量看成是新点,也就是进行缩点,求出这些缩点的出度,记录出度为0的点,边的个数求法就是(ans1+1)/2(这个也是在网上学习的)。#include<iostream>#include<algorithm>#include<cmath>#include<cstring>#include<cstdio>#include<vector&原创 2021-04-21 20:32:24 · 195 阅读 · 0 评论 -
poj3694(双联通分量+LCA)
题意:就是要求#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<stack>#include<cstdio>using namespace std;const int maxx=200006;struct node{ int v; int next;}e[maxx原创 2021-04-21 19:21:14 · 107 阅读 · 0 评论