POJ 3268 Silver Cow Party（dijkstra最短路）

被别人机智的转置矩阵了一下给过了。。

就是正着dijkstra之后，把边反向在求一次dijkstra

#pragma warning(disable:4996)
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int n, m, x;
int mp[1005][1005];
int dis[1005], dis2[1005];
bool vis[1005];

void dijkstra() {
	memset(dis, 0x3f, sizeof dis);
	memset(vis, false, sizeof vis);
	dis[x] = 0;
	//vis[x] = true;
	int u = x;
	while (true) {
		vis[u] = true;
		for (int i = 1; i <= n; i++) {
			if (u == i)continue;
			if (mp[u][i] == mp[0][0])continue;
			if (dis[i] > dis[u] + mp[u][i]) {
				dis[i] = dis[u] + mp[u][i];
			}
		}
		u = -1;
		for (int i = 1; i <= n; i++) {
			if (!vis[i] && (u == -1 || dis[u] > dis[i]))u = i;
		}
		if (u == -1)break;
	}
}

int main() {
	//freopen("in.txt", "r", stdin);
	scanf("%d %d %d", &n, &m, &x);
	memset(mp, 0x3f, sizeof mp);
	for (int i = 1; i <= n; i++)mp[i][i] = 0;
	for (int i = 1; i <= m; i++) {
		int u, v, c;
		scanf("%d %d %d", &u, &v, &c);
		mp[u][v] = min(mp[u][v], c);
	}

	dijkstra();

	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			swap(mp[i][j], mp[j][i]);
		}
	}
	for (int i = 1; i <= n; i++)dis2[i] = dis[i];
	dijkstra();
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		ans = max(ans, dis[i] + dis2[i]);
	}
	printf("%d\n", ans);
	return 0;
}