POJ 3177 Redundant Paths（边连通分量）

题目链接：http://poj.org/problem?id=3177
题目大意：n个顶点，m条边，要求至少建立多少条边，使得任意两点间 的独立路径至少两条（独立路径指与其它路径不含有重边，可以好友重点）

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1010;
struct Node{
    int v, nxt;
}edge[N*100];
int head[N], idx;
int n, m;
int st[N];
int belong[N], dfn[N], low[N];
bool vis[N];
int bridge[N*10][2], nbridge, D[N];
int find(int x){ return x==st[x]?x:(st[x]=find(st[x]));}
void Union(int a,int b){
    int x = find(a), y = find(b);
    if( x != y ) st[x] = y;
}
void AddEdge(int u,int v)
{
    edge[idx].v = v;
    edge[idx].nxt = head[u];
    head[u] = 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); u--, v--;
        AddEdge(u,v), AddEdge(v,u);
    }
}
void tarjan(int u,int pre,int dep){
    vis[u] = true;
    dfn[u] = low[u] = dep;
    for(int i = head[u]; ~i; i = edge[i].nxt)
    {
        int v = edge[i].v;
        if( v == pre ) continue;
        if( vis[v] ) low[u] = min( low[u], dfn[v] );
        else{
            tarjan( v,u,dep+1);
            low[u] = min( low[u], low[v] );
            if( dfn[u] >= low[v] ) Union(u,v);
            if( dfn[u] <  low[v] ){
                bridge[nbridge][0] = u; bridge[nbridge++][1] = v;
            }
        }
    }
}
int GetConnection(){
    for(int i = 0; i < n; i++) st[i] = i;
    nbridge = 0;
    memset(vis,0,sizeof(vis));
    memset(belong,-1,sizeof(belong));
    tarjan(0,-1,1);

    int conn = 0;
    for(int i = 0; i < n; i++)
    {
        int k = find(i);
        if( belong[k] == -1 ) belong[k] = conn++;
        belong[i] = belong[k];
    }
    return conn;
}
void solve(){
    int w = GetConnection();
    memset( D, 0, sizeof(D));
    for(int i = 0; i < nbridge; i++)
    {
        int u = bridge[i][0], v = bridge[i][1];
        D[ belong[u] ]++, D[ belong[v] ]++;
    }
    int cnt = 0;
    for(int i = 0; i < w; i++)
        if( D[i] == 1 ) cnt++;
    printf("%d\n", (cnt+1)/2 );
}
int main(){
    while( scanf("%d%d", &n,&m) != EOF)
    {
        input();
        solve();
    }
    return 0;
}