hdu4612（缩点+树的直径）

题目

要使桥最少，就联通的点越多越好，也就是找缩点后的树的直径，两次dfs求，第一次先找任意一点，求到达的最远的点，再用那个点求dfs，求到的最远距离及时树的直径。

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stack>
using namespace std;
const int inf = 0x3f3f3f3f;
#define N 200010
#define LL long long
struct node
{
	int v, nxt;
}e[N * 10], w[N * 10];
int head[N], cnt = 1, ti, ans, flag;
int whead[N], wcnt;
int dfn[N], low[N], scc[N], book[N];
int vis[N], f1, f2;
void init()
{
	memset(head, 0, sizeof(head));
	memset(whead, 0, sizeof(head));
	memset(vis, 0, sizeof(vis));
	memset(low, 0, sizeof(low));
	memset(dfn, 0, sizeof(dfn));
	cnt = 1;
	f2 = flag = ti = ans = wcnt = 0;
}
void add(int u, int v)
{
	e[++cnt].v = v;
	e[cnt].nxt = head[u];
	head[u] = cnt;
}
void wadd(int u, int v)
{
	w[++wcnt].v = v;
	w[wcnt].nxt = whead[u];
	whead[u] = wcnt;
}
stack<int>s;
void tarjan(int u, int fa)
{
	dfn[u] = low[u] = ++ti;
	s.push(u);
	book[u] = 1;
	for (int i = head[u]; i; i = e[i].nxt)
	{
		if (i == (fa ^ 1))continue;
		int v = e[i].v;
		if (!dfn[v])
		{
			tarjan(v, i);
			low[u] = min(low[u], low[v]);
			if (low[v] > dfn[u])ans++;
		}
		else if(book[v])low[u] = min(low[u], dfn[v]);
	}
	if (dfn[u] == low[u]) {
		++flag;
		while (1) {
			int v = s.top();
			s.pop();
			book[v] = 0;
			scc[v] = flag;
			if (v == u)  break;
		}
	}
}
void dfs(int x, int s)
{
	if (f2 < s)f1 = x, f2 = s;
	vis[x] = 1;
	for (int i = whead[x]; i; i = w[i].nxt)
	{
		int v = w[i].v;
		if (!vis[v])
		{
			dfs(v, s + 1);
		}
	}
}
int main()
{
	int n, m;
	int u, v;
	while (scanf("%d%d", &n, &m) && n && m)
	{
		init();
		while (m--)
		{
			scanf("%d%d", &u, &v);
			add(u, v);
			add(v, u);
		}
		tarjan(1, -1);
		for (u = 1; u <= n; u++)
		{
			for (int i = head[u]; i; i = e[i].nxt)
			{
				v = e[i].v;
				if (scc[u] != scc[v])
				{
					wadd(scc[u], scc[v]);
				}
			}
		}
		dfs(1, 0);
		memset(vis, 0, sizeof(vis));
		f2 = 0;
		dfs(f1, 0);
		cout << ans - f2 << endl;
	}
	return 0;
}