HDU 4612 Warm up（无向图强连通分量缩点建树）

题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=4612
题意：求加一条边形成的最少桥数目。
解法：先双连通分量缩点，形成一颗树，然后求树的直径，就是减少的桥。需要手动开栈。

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<stack>
#include<algorithm>
using namespace std;
const int N = 200010;
const int M = 1000010;
struct Edge{
    int v, nxt, flag;
}edge[M<<2];
int head[N], idx;
int n, m;
int dfn[N], low[N], dep, vis[N];
int id[N], conn;
bool instack[N];
int nbridge, bridge[M][2];
int maxlen;
stack<int> st;
void AddEdge(int u,int v){
    edge[idx].v = v; edge[idx].nxt = head[u];
    edge[idx].flag = 1; head[u] = idx++;
    edge[idx].v = u; edge[idx].nxt = head[v];
    edge[idx].flag = 1; head[v] = idx++;
}
void input(){
    memset(head,-1,sizeof(head));
    idx = 0;
    for(int i = 0; i < m; i++)
    {
        int u, v;
        scanf("%d%d", &u,&v);
        AddEdge(u,v);
    }
}
void tarjan(int u,int pre) // 无向图，数据有回边.需要将其看做不同边.且边需要标记.
{
    vis[u] = true;
    dfn[u] = low[u] = ++dep;
    st.push(u); instack[u] = true;
    for(int i = head[u]; ~i; i = edge[i].nxt )
    {
        int v = edge[i].v;
        if( edge[i].flag == false ) continue;
        edge[i].flag = edge[i^1].flag = false;
        if( !vis[v] ){
            tarjan(v,u);
            low[u] = min( low[u], low[v] );
            if( (dfn[u] < low[v]) ){
                bridge[ nbridge ][0] = u;
                bridge[ nbridge++ ][1] = v;
            }
        }
        else if( instack[v] )
            low[u] = min( low[u], dfn[v] );
    }
    if( dfn[u] == low[u] )
    {
        int t;
        do{
            id[t=st.top()] = conn; st.pop();
            instack[t] = false;
        }while(t!=u);
        conn++;
    }
}
void GetConnect(){
    memset(vis,0,sizeof(vis));
    memset(instack,0,sizeof(instack));
    nbridge = 0;
    conn = 0; dep = 0;
    while( !st.empty() ) st.pop();
    for(int i = 1; i <= n; i++)
        if( !vis[i] ) tarjan(i,0);
}
void ReGraph(){
    memset(head,-1,sizeof(head));
    idx = 0;
    for(int i = 0; i < nbridge; i++){
        int u = id[ bridge[i][0] ], v = id[ bridge[i][1] ];
        AddEdge(u,v);
    }
}
int dfs(int u,int pre)
{
    int tmp = 0;
    for(int i = head[u]; ~i; i = edge[i].nxt )
    {
        int v = edge[i].v;
        if( v == pre ) continue;

        int d = dfs(v,u);
        maxlen = max( maxlen, tmp+d );
        tmp = max(tmp,d);
    }
    return tmp+1;
}
void solve(){
    GetConnect();
    ReGraph();

    maxlen = 0;
    dfs(0,-1);
    printf("%d\n", conn-(maxlen+1) );
}
int main(){
    while( scanf("%d%d", &n,&m) != EOF  )
    {
        if(n + m == 0) break;
        input();
        solve();
    }
    return 0;
}