Silver Cow Party（好题）

给出n个点和m条边，接着是m条边，代表从牛a到牛b需要花费c时间，现在所有牛要到牛x那里去参加聚会，并且所有牛参加聚会后还要回来，给你牛x，除了牛x之外的牛，他们都有一个参加聚会并且回来的最短时间，从这些最短时间里找出一个最大值输出
Input
Line 1: Three space-separated integers, respectively: N, M, and X
Lines 2… M+1: Line i+1 describes road i with three space-separated integers: Ai, Bi, and Ti. The described road runs from farm Ai to farm Bi, requiring Ti time units to traverse.
Output
Line 1: One integer: the maximum of time any one cow must walk.
Sample Input
4 8 2
1 2 4
1 3 2
1 4 7
2 1 1
2 3 5
3 1 2
3 4 4
4 2 3
Sample Output
10
Hint
Cow 4 proceeds directly to the party (3 units) and returns via farms 1 and 3 (7 units), for a total of 10 time units.
思路：此题是使用两次迪杰斯特朗（dijkstra）算法，基本上是套用dijkstra的模板，只是稍微改动了一下。用两个二维数组能够更好更清晰的知道查找到哪一步且用时最短，e1代表去时的用时，e2代表回来时的路程，dist数组后缀与之相对应。这个题目应该找的是每个点到x点的用时最短，而不是到最后一个点的用时最短，（注意一下细节），其他什么的看代码吧。

在这里插入代码片
#include"cstdio"
#include"cstring"
#include"iostream"
#include"algorithm"
using namespace std;
#define N 1005
#define INF 0x3f3f3f3f
int e1[N][N],e2[N][N];
int dist1[N];
int dist2[N];
bool visited[N];
int x , n , m;
/*void init_e()//初始化 
{
	for(int i = 1 ; i <= n ; i ++)
	{
		for(int j = 1 ; j <= n ; j ++)
		{
			if(i == j)
				e[i][j] = 0;
			else
				e[i][j] = INF;
		}
	}
}*/
void Dijkstra(int e[][N],int dist[])
{
	memset(visited,0,sizeof(visited));
	memset(dist,INF,sizeof(dist));
	for(int i = 1 ; i <= n ; i ++)
	{
		dist[i] = e[x][i];// dist数组用来存第一个到每个节点的距离 
	//	printf("%d  \n",dist[i]); 
	}
	visited[x] = 1;
	dist[x]=0;
	for(int j = 1 ; j <= n ; j ++)
	{
		int min = INF , u;
		for(int i = 1 ; i <= n ; i ++)
		{	
			if(!visited[i] && dist[i] < min)
			{
				
				min = dist[i];
				u = i;		
			}
		}
		visited[u] = 1;
		for(int i = 1 ; i <= n ; i ++)
		{
			if(!visited[i] &&e[u][i]!=INF&& dist[u] + e[u][i] < dist[i])
			{
				dist[i] = dist[u] + e[u][i];
			}
		}
	}
	//for(int i = 1 ; i <= n ; i ++)
	//printf("%d\n",dist[n]);
}
int main()
{
	while(~scanf("%d %d %d",&n,&m,&x))
	{
		//init_e();
		memset(e1,INF,sizeof(e1));
		memset(e2,INF,sizeof(e2));
		memset(dist1,INF,sizeof(dist1));
		memset(dist2,INF,sizeof(dist2));
		int a , b , w;
		for(int i = 0 ; i < m ; i ++)
		{	
			scanf("%d %d %d",&a,&b,&w);
			e1[a][b] = w;
			e2[b][a] = w;
		}
		Dijkstra(e1,dist1);
		Dijkstra(e2,dist2);
		int maxn=0;
		for(int i=1;i<=n;i++)
		{
			if(i!=x)
			{
				if(dist1[i]+dist2[i]>maxn)
				{
					maxn=dist1[i]+dist2[i];
				}
			}
		}
		printf("%d\n",maxn);
	}
	return 0;
}