题目链接
题意
给你一个连通图,你可以任意加一条边,求最小桥数量。
思路
先用tarjan求所有桥,将双边连通的点缩点,再对缩点后的新图加上桥,得到cnt新图的点数。
求新图的直径,在直径两端加一条边最优(可以消去最多的桥),答案即,新图点数-1-直径长度。
代码
#include <stdio.h>
#include <string.h>
#include <stack>
#include <vector>
using namespace std;
int first[200005], tot;
struct Edge
{
int v, nxt;
}e[2000005];
stack<int> sta;
vector<pair<int,int>> bri;
vector<int> newe[200005];
int dfn[200005], low[200005], col[200005], cnt, tim, dp[200005], ans, vis[200005];
void add(int u, int v)
{
e[tot].v = v;
e[tot].nxt = first[u];
first[u] = tot++;
}
void tarjan(int u, int id)
{
dfn[u] = low[u] = ++tim;
sta.push(u);
for(int i = first[u]; ~i; i = e[i].nxt)
{
if(i == (1^id)) continue;
int v = e[i].v;
if(!dfn[v])
{
tarjan(v,i);
low[u] = min(low[u], low[v]);
if(low[v] > dfn[u]) bri.push_back(make_pair(u,v));
}
else low[u] = min(low[u], dfn[v]);
}
if(dfn[u] == low[u])
{
++cnt;
while(1)
{
int now = sta.top();
sta.pop();
col[now] = cnt;
if(now == u) break;
}
}
}
void dfs(int u)
{
dp[u] = 0;
vis[u] = 1;
for(int i = 0; i < newe[u].size(); ++i)
{
int v = newe[u][i];
if(vis[v]) continue;
dfs(v);
ans = max(ans, dp[u]+dp[v]+1);
dp[u] = max(dp[u], dp[v]+1);
}
}
int main()
{
int n, m, u, v;
while(scanf("%d%d",&n,&m), n+m)
{
memset(first,-1,sizeof(first));
tot = 0;
while(m--)
{
scanf("%d%d",&u,&v);
add(u,v);
add(v,u);
}
for(int i = 1; i <= n; ++i) dfn[i] = low[i] = vis[i] = col[i] = 0;
while(!sta.empty()) sta.pop();
bri.clear();
tim = cnt = ans = 0;
tarjan(1,-1);
for(int i = 0; i <= cnt; ++i) newe[i].clear();
for(int i = 0; i < bri.size(); ++i)
{
newe[col[bri[i].first]].push_back(col[bri[i].second]);
newe[col[bri[i].second]].push_back(col[bri[i].first]);
}
dfs(1);
printf("%d\n",cnt-1-ans);
}
return 0;
}