CodeForces 666B World Tour

题意：给出一个有向图，现在要经过四个城市，每两个城市之间距离为他们的最短路，求出经过这四个城市的最大距离。

思路：直接枚举四个城市的话复杂度为O(n^4)，现在考虑枚举中间两个城市，那么这两个城市向外各连接一个城市，也就是说我们可以预处理出每个城市出发所到达的最远城市和到达每个城市所能最远距离，但是这样的话四个城市之中可能会出现重复的城市，所以预处理出每个城市出发所能到达的最大的三个城市和到达每个城市距离最大的三个城市，这样枚举的复杂度为O(n^2*9)。

#include <bits/stdc++.h>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

const int MAXN = 3010;
//const int INF = 0x3f3f3f3f;
int n, m;
vector<int> G[MAXN];
int dist[MAXN][MAXN];
bool vis[MAXN];
pii s[MAXN][3], e[MAXN][3];
void updateS(int u, int v) {
	s[u][2] = s[u][1];
	s[u][1] = s[u][0];
	s[u][0] = mp(v, dist[u][v]);
} 
void updateE(int u, int v) {
	if (dist[u][v] > e[v][0].second) {
		e[v][2] = e[v][1];
		e[v][1] = e[v][0];
		e[v][0] = mp(u, dist[u][v]);
	}
	else if (dist[u][v] > e[v][1].second) {
		e[v][2] = e[v][1];
		e[v][1] = mp(u, dist[u][v]);
	}
	else if (dist[u][v] > e[v][2].second) 
		e[v][2] = mp(u, dist[u][v]);
}
void bfs(int st) {
	queue<int> q;
	memset(vis, 0, sizeof(vis));
	q.push(st);
	vis[st] = true;
	dist[st][st] = 0;
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		for (int i = 0; i < G[u].size(); i++) {
			int v = G[u][i];
			if (vis[v]) continue;
			dist[st][v] = dist[st][u] + 1;
			vis[v] = true;
			updateS(st, v);
			updateE(st, v);
			q.push(v);
		}
	}
}
bool check(int u, int v, int num1, int num2) {
	int node[4] = {u, v, e[u][num1].first, s[v][num2].first};
	if (e[u][num1].first == 0 || s[v][num2].first == 0) return false;
	for (int i = 0; i < 4; i++) {
		for (int j = i+1; j < 4; j++)
			if (node[i] == node[j]) return false;
	}
	return true;
}
int main()
{
	freopen("input.txt", "r", stdin);
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++) {
		int u, v;
		scanf("%d%d", &u, &v);
		G[u].push_back(v);
	}
	for (int i = 1; i <= n; i++)
		bfs(i);
	int ans = 0;
	int node[4]; 
	for (int i = 1; i <= n; i++) { 
		for (int j = 1; j <= n; j++) {
			if (i == j || dist[i][j] == 0) continue;
			for (int k1 = 0; k1 < 3; k1++) {
				for (int k2 = 0; k2 < 3; k2++) {
					if (!check(i, j, k1, k2)) continue;
					if (e[i][k1].second+dist[i][j]+s[j][k2].second > ans) {
						node[0] = e[i][k1].first;
						node[1] = i;
						node[2] = j;
						node[3] = s[j][k2].first;
						ans = e[i][k1].second+dist[i][j]+s[j][k2].second;
					}
				}
			}
		}
	}
	for (int i = 0; i < 4; i++)
		printf("%d ", node[i]);
	return 0;
}