传送门
题目描述
分析
这两天整理板子发现这道题去年wa了之后一直没补,今天处理一下
首先缩点,然后建图就是一棵树,树上的每一条边都是桥,然后我们找出树的直径,直径两端两一条边就可以链接最多的桥边
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 200010,M = 2000020;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],ne[M],e[M],idx;
int dfn[N],low[N],ti;
bool is_bridge[M];
int id[N];
stack<int> Q;
int d[N];
int n,m;
int dcc_cnt;
bool vis[N];
vector<int> g[N];
void add(int x,int y){
e[idx] = y,ne[idx] = h[x],h[x] = idx++;
}
void tarjan(int u,int from){
dfn[u] = low[u] = ++ti;
Q.push(u);
for(int i = h[u];~i;i = ne[i]){
int j = e[i];
if(!dfn[j]){
tarjan(j,i);
low[u] = min(low[u],low[j]);
if(dfn[u] < low[j])
is_bridge[i] = is_bridge[i ^ 1] = true;
}
else if(i != (from ^ 1))
low[u] = min(low[u],dfn[j]);
}
if(low[u] == dfn[u]){
++ dcc_cnt;
int y;
do{
y = Q.top();
Q.pop();
id[y] = dcc_cnt;
}while(y != u);
}
}
int bfs(int u){
memset(vis, 0, sizeof(vis));
queue<int> q;
q.push(u);
vis[u] = 1;
d[u] = 0;
int temp;
while (!q.empty()) {
temp = q.front();
q.pop();
int siz = g[temp].size();
for (int i = 0; i < siz; i++) {
int v = g[temp][i];
if (vis[v]) continue;
vis[v] = 1;
d[v] = d[temp] + 1;
q.push(v);
}
}
return temp;
}
void init(){
idx = 0;
ti = 0;
while(Q.size()) Q.pop();
dcc_cnt = 0;
memset(h,-1,sizeof h);
memset(dfn,0,sizeof dfn);
memset(is_bridge,false,sizeof is_bridge);
}
int main() {
while(scanf("%d%d",&n,&m) && (n && m)){
init();
while(m--){
int x,y;
read(x),read(y);
add(x,y),add(y,x);
}
tarjan(1,0);
for(int i = 1;i <= dcc_cnt;i++) g[i].clear();
for(int i = 1;i <= n;i++){
for(int p = h[i];~p;p = ne[p]){
int j = e[p];
int x = id[i],y = id[j];
if(x == y) continue;
g[x].pb(y);
g[y].pb(x);
}
}
di(dcc_cnt - 1 - d[bfs(bfs(1))]);
}
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/