hdu 1595 find the longest of the shortest (枚举+最短路)

find the longest of the shortest

Time Limit: 1000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1751    Accepted Submission(s): 619


Problem Description
Marica is very angry with Mirko because he found a new girlfriend and she seeks revenge.Since she doesn't live in the same city, she started preparing for the long journey.We know for every road how many minutes it takes to come from one city to another.
Mirko overheard in the car that one of the roads is under repairs, and that it is blocked, but didn't konw exactly which road. It is possible to come from Marica's city to Mirko's no matter which road is closed.
Marica will travel only by non-blocked roads, and she will travel by shortest route. Mirko wants to know how long will it take for her to get to his city in the worst case, so that he could make sure that his girlfriend is out of town for long enough.Write a program that helps Mirko in finding out what is the longest time in minutes it could take for Marica to come by shortest route by non-blocked roads to his city.
 

 

Input
Each case there are two numbers in the first row, N and M, separated by a single space, the number of towns,and the number of roads between the towns. 1 ≤ N ≤ 1000, 1 ≤ M ≤ N*(N-1)/2. The cities are markedwith numbers from 1 to N, Mirko is located in city 1, and Marica in city N.
In the next M lines are three numbers A, B and V, separated by commas. 1 ≤ A,B ≤ N, 1 ≤ V ≤ 1000.Those numbers mean that there is a two-way road between cities A and B, and that it is crossable in V minutes.
 

 

Output
In the first line of the output file write the maximum time in minutes, it could take Marica to come to Mirko.
 

 

Sample Input
5 6 1 2 4 1 3 3 2 3 1 2 4 4 2 5 7 4 5 1 6 7 1 2 1 2 3 4 3 4 4 4 6 4 1 5 5 2 5 2 5 6 5 5 7 1 2 8 1 4 10 2 3 9 2 4 10 2 5 1 3 4 7 3 5 10
 

 

Sample Output
11 13 27

 注意细节

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 #include <string>
 5 using namespace std;
 6 #define INF 9999999
 7 int N, M;
 8 #define maxn  1010
 9 int mp[maxn][maxn];
10 int vis[maxn];
11 int u, v, w; 
12 int dis[maxn];
13 int pre[maxn];
14 bool judge;
15 int dijkstra(){
16     memset(vis, 0, sizeof(vis));
17     int pos = 1;
18     for(int i = 1; i <= N; i++) dis[i] = INF;
19     dis[1] = 0;
20     for(int i = 1; i <= N; i++){
21         int min = INF;
22         for(int j = 1; j <= N; j++){
23             if(!vis[j] && dis[j] < min){
24                 min = dis[j]; pos = j;
25             }
26         }
27         vis[pos] = 1;
28         for(int j = 1; j <= N; j++){
29             if(!vis[j] && dis[j] > mp[pos][j] + dis[pos]){
30                  dis[j] = mp[pos][j] + dis[pos];
31                  if(judge) {pre[j] = pos;
32                  }
33             } 
34         }
35 
36     }
37     return dis[N];
38 }
39 int main(){
40     while(~scanf("%d%d", &N, &M)){
41         
42     
43         for(int i = 1; i <= N; i++){
44             for(int j = 1; j <= N; j++){
45                 if(i != j) mp[i][j] = INF;
46                 else mp[i][j] = 0;
47             }
48         }
49         int a, b, c;
50         memset(pre, 0, sizeof(pre));
51         for(int i = 1; i <= M; i++){
52             scanf("%d%d%d", &a, &b, &c);
53             if(mp[a][b] > c) mp[a][b] = mp[b][a] = c;
54         }
55         judge = true;
56         int ans = dijkstra();
57         judge = false;
58         for(int i = N; i != 1; i = pre[i]){
59             int temp = mp[i][pre[i]];            
60             mp[i][pre[i]] = mp[pre[i]][i] = INF;
61             if(dijkstra() > ans) ans = dijkstra();
62             mp[i][pre[i]] = mp[pre[i]][i] = temp;
63             
64 
65         }
66         printf("%d\n", ans);
67     }
68     
69     
70     
71     return 0;
72 }

 

posted @ 2014-08-17 20:01  下周LGD该赢了吧  阅读(171)  评论(0)  编辑  收藏  举报