HDU-4612 Warm up

找出在无向图中加入一条边，使图中桥的数量最少是多少

先缩点，找出各个强连通分量，找出的强连通分量个数-1就是桥的数量了

缩点后重新建图，每个连通分量是一个点，由桥作为边连接这些点，这时候图就是一棵树了

要想加入一条边，让桥最大数量减少，那么我们只需要找到树的直径，在直径两端加一条边，形成一个环

详见代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
const int MAXN = 200010;//点数
const int MAXM = 2000100;//边数
struct Edge
{
	int to,next;
}edge[MAXM];
int head[MAXN],tot;
int Low[MAXN],DFN[MAXN],Stack[MAXN],Belong[MAXN],father[MAXN];//Belong数组的值是1~scc
int Index,top;
int scc;//强连通分量的个数
bool Instack[MAXN],vis[MAXM];
void addedge(int u,int v)
{
	edge[tot].to = v;edge[tot].next = head[u];head[u] = tot++;
}
void Tarjan(int u,int f)
{
	int v;
	Low[u] = DFN[u] = ++Index;
	Stack[top++] = u;
	Instack[u] = true;
	for(int i = head[u];i != -1;i = edge[i].next)
	if(!vis[i])
	{
        vis[i]=vis[i^1]=true;
		v = edge[i].to;
		if( !DFN[v] )
		{
            father[v]=u;
			Tarjan(v,u);
			if( Low[u] > Low[v] )Low[u] = Low[v];
		}
		else if(Instack[v] && Low[u] > DFN[v])
		Low[u] = DFN[v];
	}
	if(Low[u] == DFN[u])
	{
		scc++;
		do
		{
			v = Stack[--top];
			Instack[v] = false;
			Belong[v] = scc;
		}while( v != u);
	}
}
void solve(int N)
{
	memset(DFN,0,sizeof(DFN));
	memset(Instack,false,sizeof(Instack));
	memset(vis,false,sizeof(vis));
	for(int i=1;i<=N;i++) father[i]=i;
	Index = scc = top = 0;
	for(int i = 1;i <= N;i++)
	if(!DFN[i]) Tarjan(i,i);
}
void init()
{
	tot = 0;
	memset(head,-1,sizeof(head));
}
int pos,md;
bool vis0[MAXN];
vector<int> g[MAXN];
void dfs(int u,int d)
{
    vis0[u]=true;
    if(d>md)
    {
        pos=u;
        md=d;
    }
    for(int i=0;i<g[u].size();i++)
    if(!vis0[g[u][i]])
    dfs(g[u][i],d+1);
}
int main()
{
    //freopen("/home/zlwang/test.txt","r",stdin);
    int n,m,a,b;
    while(~scanf("%d%d",&n,&m))
    {
        if(n==0&&m==0) break;
        init();
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&a,&b);
            addedge(a,b);
            addedge(b,a);
        }
        solve(n);
        for(int i=1;i<=n;i++) g[i].clear();
        for(int i=1;i<=n;i++)
        for(int j=head[i];j!=-1;j=edge[j].next)
        if(Belong[i]!=Belong[edge[j].to])
        {
            g[Belong[i]].push_back(Belong[edge[j].to]);
            g[Belong[edge[j].to]].push_back(Belong[i]);
        }
        md=0;
        memset(vis0,false,sizeof(vis0));
        dfs(1,0);
        md=0;
        memset(vis0,false,sizeof(vis0));
        dfs(pos,0);
        printf("%d\n",scc-1-md);
    }
    return 0;
}