E. We Need More Bosses(无向图环缩点+树的直径)

题目

题意：

    给定一张无向图，要求在上面选择两个点s,t，若某条边删去后，无法从s到t，则对答案的贡献加1，要求最大的答案。
    $2\le n\le 3\cdot 10^5,n-1\le m\le 3\cdot 10^5。$

分析：

    首先成环的那些边一定不会对答案产生贡献，所以我们把成环的点缩成一个点，然后缩点之后，图就无环了，也就变成了一棵树。那么答案就是树的直径了。

#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
using namespace std;

vector<int> g[300005],g_new[300005];
int vis[300005],dfn[300005],low[300005];
int scc[300005],c = 1;   
stack<int> s;
int cnt = 0;  
int depth[300005];

void tarjan(int x,int fa)    
{
	dfn[x] = low[x] = ++cnt;
	s.push(x);
	vis[x] = 1;
	for (int i = 0; i < g[x].size(); i++)
	{
		int t = g[x][i];
		if( t == fa ) continue;
		if( !dfn[t] )   
		{
			tarjan(t,x);
			low[x] = min(low[x],low[t]); 
		}else if( vis[t] )   
		{
			low[x] = min(low[x],low[t]);   
		}
	} 
	if( dfn[x] == low[x] )    
	{
		vis[x] = 0;
		scc[x] = c;        
		while( s.top() != x )   
		{
			vis[s.top()] = 0;
			scc[s.top()] = c;  
			s.pop(); 
		}
		c ++;  
		s.pop();   
	}
}

void compress(int n)  
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j < g[i].size(); j++)  
		{
			int t = g[i][j];
			if( scc[i] != scc[t] ) 
			{
				g_new[scc[i]].push_back(scc[t]);   
			}
		}
	}
}

void dfs(int x,int fa)
{
	depth[x] = depth[fa] + 1;
	for (int i = 0; i < g_new[x].size(); i++)
	{
		int t = g_new[x][i];
		if( t == fa ) continue;
		dfs(t,x);
	}
}

int main()
{
	int n,m;
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int x,y;
		cin >> x >> y;
		g[x].push_back(y); 
		g[y].push_back(x);
	}
	tarjan(1,0);
	compress(n);
	dfs(1,0);
	int index = 0,maxn = 0;
	for (int i = 1; i <= n; i++)
	{
		if( maxn < depth[i] )
		{
			maxn = depth[i];
			index = i;
		}
	}
	dfs(index,0);
	int ans = 0;
	for (int i = 1; i <= n; i++)
	{
		ans = max(ans,depth[i]);
	}
	cout << ans - 1 << '\n';
	return 0;
}