【强连通】 HDU 4612 Warm up

点击打开链接

题意：求添加一条边后，最少有多少条割桥。（会有重边）

解：需要求割桥，撸一个强连通后统计下割桥个数。然后选择添加边，要使减少的桥最多，需要使得 强连通后的树中形成一个最大的圆。

就是这树的直径（用两次BFS可得）

（还要加扩栈挂！！！！！！）

#pragma comment(linker, "/STACK:1024000000,1024000000")  
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define cler(arr, val)    memset(arr, val, sizeof(arr))
#define FOR(i,a,b)  for(int i=a;i<=b;i++)
#define IN   freopen ("in.txt" , "r" , stdin);
#define OUT  freopen ("out.txt" , "w" , stdout);
typedef long long  LL;
const int MAXN = 510011;
const int MAXM = 6000010;
const int INF = 0x3f3f3f3f;
const LL mod = 2147483647;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1
const int N = 210011;
const int M = 2000010;
int n, m;//n m 为点数和边数
struct Edge{
    int from, to, nex;
    bool sign;//是否为桥
}edge[M];
int head[N], edgenum;
void add(int u, int v){//边的起点和终点
    Edge E={u, v, head[u], false};
    edge[edgenum] = E;
    head[u] = edgenum++;
}

int DFN[N], Low[N], Stack[N], top, Time; //Low[u]是点集{u点及以u点为根的子树} 中(所有反向弧)能指向的(离根最近的祖先v) 的DFN[v]值(即v点时间戳)
int taj;//连通分支标号，从1开始
int Belong[N];//Belong[i] 表示i点属于的连通分支
int bridge;
bool Instack[N];
vector<int> bcc[N]; //标号从1开始

void tarjan(int u ,int fa)
{
    DFN[u] = Low[u] = ++ Time ;
    Stack[top ++ ] = u ;
    Instack[u] = 1 ;
    int flag=1;
    for (int i = head[u] ; ~i ; i = edge[i].nex )
    {
        int v = edge[i].to;
        if(flag&&v==fa) {flag=0;continue;}
        if(DFN[v] == -1)
        {
            tarjan(v , u);
            Low[u] = min(Low[u] ,Low[v]) ;
            if(DFN[u] < Low[v])
            {
                edge[i].sign =edge[i^1].sign = 1;//为割桥
            }
        }
        else if(Instack[v])
        {
            Low[u] = min(Low[u] ,DFN[v]) ;
        }
    }
    if(Low[u] == DFN[u])
    {
        int now;
        taj ++ ;
        bcc[taj].clear();
        do{
            now = Stack[-- top] ;
            Instack[now] = 0 ;
            Belong [now] = taj ;
            bcc[taj].push_back(now);
        }while(now != u) ;
    }
}

void tarjan_init(int all){
    memset(DFN, -1, sizeof(DFN));
    memset(Instack, 0, sizeof(Instack));
    top = Time = taj = 0;
    for(int i=1;i<=all;i++)
        if(DFN[i]==-1 )
            tarjan(i, -1); //注意开始点标！！！
}
vector<int>G[N];
int du[N];
void suodian(){
    memset(du, 0, sizeof(du));
    for(int i = 0; i <= taj; i++)
        G[i].clear();
    for(int i = 0; i < edgenum; i+=2)
    {
        int u = Belong[edge[i].from], v = Belong[edge[i].to];
        if(u!=v)
        {
            G[u].push_back(v), du[v]++;
            G[v].push_back(u), du[u]++;
        }
        bridge+=edge[i].sign;
    }
}
int dis[N];
int BFS(int u){
    for(int i = 0;i<=n;i++)dis[i] = INF;
    dis[u] = 0;
    queue<int>q;
    q.push(u);
    int pos = u, d = 0;
    while(!q.empty()){
        u = q.front(); q.pop();
        for(int i=0;i<G[u].size();i++)
        {
            int v = G[u][i];
            if(dis[v] > dis[u]+1)
            {
                dis[v] = dis[u]+1;
                q.push(v);
                if(dis[v] > d)d=dis[v] , pos = v;
            }
        }
    }
    return pos;
}
void init(){memset(head, -1, sizeof(head)); edgenum=0;bridge=0;}
int main()
{
    while(scanf("%d%d",&n,&m),n+m)
    {
        init();
        int a,b;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&a,&b);
            add(a,b);
            add(b,a);
        }
        tarjan_init(n);
        suodian();
        int u=BFS(1);
        int v=BFS(u);
        printf("%d\n",bridge-dis[v]);
    }
    return 0;
}