题目大意:给一个图,现在可以添一条边。问,最小可能的边双连通块的快数。
思路:想到缩点是不难的。缩点之后就没有环了。只能加一条边,显然是加到一条直径的两端最好。
#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<cmath>
#include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<ctime>
#include<map>
#include<set>
using namespace std;
#define MP(x,y) make_pair((x),(y))
#define PB(x) push_back(x)
typedef __int64 LL;
//typedef unsigned __int64 ULL;
/* ****************** */
const int INF=100011122;
const double INFF=1e100;
const double eps=1e-8;
const int mod=9999991;
const int NN=200005;
const int MM=1000010;
/* ****************** */
struct G
{
int u,v,next;
}E[MM*2],E1[MM*2];
int p[NN],T;
int p1[NN],T1;
int dfn[NN],low[NN],tsp;
int id[NN],id_cnt;
int sta[NN],sta_top;
int deep[NN];
void add(int u,int v)
{
E[T].u=u;
E[T].v=v;
E[T].next=p[u];
p[u]=T++;
}
void add1(int u,int v)
{
E1[T1].u=u;
E1[T1].v=v;
E1[T1].next=p1[u];
p1[u]=T1++;
}
void bcc(int u,int fa,int pre_edge)
{
int i,v;
dfn[u]=low[u]=++tsp;
sta[++sta_top]=u;
for(i=p[u];i+1;i=E[i].next)
{
if((i^1)==pre_edge)continue;
v=E[i].v;
if(dfn[v]==0)
{
bcc(v,u,i);
low[u]=min(low[u],low[v]);
}
else
low[u]=min(low[u],dfn[v]);
}
if(dfn[u]==low[u])
{
id_cnt++;
for(;;)
{
v=sta[sta_top--];
id[v]=id_cnt;
if(v==u)break;
}
}
}
void dfs(int u)
{
int i,v;
for(i=p1[u];i+1;i=E1[i].next)
{
v=E1[i].v;
if(dfn[v]==0)
{
dfn[v]=1;
deep[v]=deep[u]+1;
dfs(v);
}
}
}
int solve(int root)
{
int i,u;
for(i=1;i<=id_cnt;i++)
dfn[i]=0;
dfn[root]=1;
deep[root]=0;
dfs(root);
u=1;
for(i=2;i<=id_cnt;i++)
if(deep[i]>deep[u])
u=i;
return u;
}
int main()
{
int n,m,u,v,i;
while(1)
{
scanf("%d%d",&n,&m);
if(n==0 && m==0)
break;
memset(p,-1,sizeof(p));
T=0;
while(m--)
{
scanf("%d%d",&u,&v);
add(u,v);
add(v,u);
}
for(i=1;i<=n;i++)
{
dfn[i]=low[i]=0;
id[i]=-1;
}
tsp=0;
id_cnt=0;
sta_top=0;
bcc(1,-1,-1);
memset(p1,-1,sizeof(p1));
T1=0;
for(i=0;i<T;i+=2)
{
u=id[ E[i].u ];
v=id[ E[i].v ];
if(u!=v)
{
add1(u,v);
add1(v,u);
}
}
u=solve(1);
u=solve(u);
printf("%d\n",id_cnt-1-deep[u]);
}
return 0;
}