HDU1595:find the longest of the shortest(Dijkstra)
来源:互联网 发布:linux排行榜2017 编辑:程序博客网 时间:2024/03/29 01:03
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.
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.
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 61 2 41 3 32 3 12 4 42 5 74 5 16 71 2 12 3 43 4 44 6 41 5 52 5 25 6 55 71 2 81 4 102 3 92 4 102 5 13 4 73 5 10
Sample Output
111327
题意:城市内有n条路,其中有某条路在修,因为这条路有很多情况,问各种情况下的最短路中最长的是哪条
思路:直接枚举所有情况算出最大值即可
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int inf = 999999999;int map[1005][1005];int vis[1005],dis[1005],link[1005];int n,m;void Dijkstra(int s,int flag){ int i,j,minn,pos; memset(vis,0,sizeof(vis)); for(i = 0; i<=n; i++) dis[i] = inf; dis[s] = 0; for(i = 1; i<=n; i++) { minn = inf; for(j = 1; j<=n; j++) { if(dis[j]<minn && !vis[j]) minn = dis[pos = j]; } vis[pos] = 1; for(j = 1; j<=n; j++) if(dis[pos]+map[pos][j]<dis[j]) { dis[j] = dis[pos]+map[pos][j]; if(flag)//只记录最短哪条路径的父节点 link[j] = pos; } }}int main(){ int i,j,x,y,w; while(~scanf("%d%d",&n,&m)) { for(i = 0; i<=n; i++) { for(j = 0; j<=n; j++) map[i][j] = inf; map[i][i] = 0; } while(m--) { scanf("%d%d%d",&x,&y,&w); if(w<map[x][y]) map[x][y] = map[y][x] = w; } memset(link,0,sizeof(link)); Dijkstra(1,1); int ans = dis[n]; for(i = n; i!=1; i=link[i]) { int tem = map[i][link[i]]; map[i][link[i]] = map[link[i]][i] = inf; Dijkstra(1,0); ans = max(ans,dis[n]); map[i][link[i]] = map[link[i]][i] = tem; } printf("%d\n",ans); } return 0;}
- HDU1595:find the longest of the shortest(Dijkstra)
- hdu1595 find the longest of the shortest(Dijkstra)
- HDU1595:find the longest of the shortest(Dijkstra)
- HDU1595 find the longest of the shortest(最短路,Dijkstra)
- hdu1595-find the longest of the shortest
- HDU1595---find the longest of the shortest
- hdu1595 find the longest of the shortest
- HDU1595 find the longest of the shortest
- HDU1595 find the longest of the shortest
- find the longest of the shortest HDU1595
- hdu1595 find the longest of the shortest (dijkstra+记录路径)
- hdu1595—find the longest of the shortest(dijkstra+枚举)
- hdu1595(spfa) find the longest of the shortest
- HDU1595 find the longest of the shortest(最短路)
- HDU1595 find the longest of the shortest(dijk+路径记录+枚举)
- HDU1595:find the longest of the shortest(spfa+记录路径)
- HDU 1595 find the longest of the shortest(Dijkstra)
- HDU 1595 find the longest of the shortest (Dijkstra)
- 大数的加减法、乘除法 code
- Android TTS 实战二:全世界都知道我爱你
- win7 64位成功安装theano,并且gpu配置成功
- STM32 外设中断配置流程
- CodeForces 25D Roads not only in Berland
- HDU1595:find the longest of the shortest(Dijkstra)
- 动态规划求解最长公共子串的问题
- C与C++类型强制转换总结
- 最全的libcurl库资源整理
- UVa 11042 Complex, difficult and complicated (一个常数很小的O(1)解决方法)
- 随心所“语”之huffman编码
- 如何将form提交到iframe
- oracle 处理锁表问题
- 新手学习latex