POJ 3268 Silver Cow Party（Dijkstra算法求解来回最短路问题）

题目链接：

https://vjudge.net/problem/POJ-3268

One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; road i requires T_i (1 ≤ T_i ≤ 100) units of time to traverse.

Each cow must walk to the party and, when the party is over, return to her farm. Each cow is lazy and thus picks an optimal route with the shortest time. A cow's return route might be different from her original route to the party since roads are one-way.

Of all the cows, what is the longest amount of time a cow must spend walking to the party and back?

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:
A_i,
B_i, and
T_i. The described road runs from farm
A_i to farm
B_i, requiring
T_i 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.

 /*
     关键是反向存储，求最短路的思维转换
 */
 #include<stdio.h>
 #include<string.h>
 #include<algorithm>
 using namespace std;
 void Dijkstra(int s,int e[][]);
 #define inf 99999999
 int dis[],book[],e[][],f[][],d[],n,m;
 int main()
 {
     int i,j,k,x,a,b,c,maxn,temp;
     while(scanf("%d%d%d",&n,&m,&x)!=EOF)
     {
         memset(d,,sizeof(d));
         for(i=;i<=n;i++)
             for(j=;j<=n;j++)
                 if(i==j)
                 {
                     e[i][j]=;
                     f[i][j]=;
                 }
                 else
                 {
                     e[i][j]=inf;
                     f[i][j]=inf;
                 }

         for(i=;i<=m;i++)
         {
             scanf("%d%d%d",&a,&b,&c);
             if(c<e[a][b])
             {
                 e[a][b]=c;
                 f[b][a]=c;
             }
         }
         Dijkstra(x,e);//回
         Dijkstra(x,f);//去
         maxn=-;
         for(i=;i<=n;i++)
         {
             if(d[i]>maxn)
                 maxn=d[i];
         }
         printf("%d\n",maxn);
     }
     return ;
 }
 void Dijkstra(int s,int e[][])
 {
     int i,j,k,min,u;
     for(i=;i<=n;i++)
         dis[i]=e[s][i];
     memset(book,,sizeof(book));
     book[s]=;
     for(k=;k<n;k++)
     {
         min=inf;
         for(i=;i<=n;i++)
             if(book[i]==&&dis[i]<min)
             {
                 min=dis[i];
                 u=i;
             }
         book[u]=;
         for(i=;i<=n;i++)
             if(book[i]==&&dis[i]>dis[u]+e[u][i])
                 dis[i]=dis[u]+e[u][i];
     }
     for(i=;i<=n;i++)
         d[i]+=dis[i];
 }