hdu1595 dijkstra
来源:互联网 发布:石家庄百度盘古网络 编辑:程序博客网 时间:2024/03/29 16:20
find the longest of the shortest
Time Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 763 Accepted Submission(s): 258
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
Author
ailyanlu
Source
HDU 2007-Spring Programming Contest - Warm Up (1)
Recommend
8600
求出最短路记录父母,枚举最短路径上的边销毁 求出最大的~~具体见代码
#include <iostream>#include <cstring>#include <cstdio>#define inf 99999999using namespace std;int map[1005][1005];int d[1005];int p[1005];int vis[1005];int n,m;void dijkstra(int f){ int i; for(i=0;i<=n;i++) d[i]=inf; d[1]=0; memset(vis,0,sizeof(vis)); for(i=1;i<=n;i++) { int y,x,m=inf; for(y=1;y<=n;y++) if(!vis[y]&&d[y]<m) m=d[x=y]; vis[x]=1; for(y=1;y<=n;y++) { if(d[y]>d[x]+map[x][y]) { d[y]=d[x]+map[x][y]; if(f) p[y]=x; } } }}int main(){ while(scanf("%d%d",&n,&m)!=EOF) { int i,j; for(i=0;i<=n;i++) for(j=0;j<=n;j++) { if(i==j) map[i][j]=0; else map[i][j]=inf; } memset(p,0,sizeof(p)); for(i=0;i<m;i++) { int u,v,w; scanf("%d%d%d",&u,&v,&w); if(w<map[u][v]) map[v][u]=map[u][v]=w; } dijkstra(1); int maxx=d[n]; for(i=n;i!=1;i=p[i]) { int t=map[i][p[i]]; map[i][p[i]]=inf; map[p[i]][i]=inf; dijkstra(0); //这一次不能记录父母 if(d[n]>maxx) { maxx=d[n]; } map[i][p[i]]=map[p[i]][i]=t; } printf("%d\n",maxx); } return 0;}
- hdu1595 dijkstra
- HDU1595(枚举+最短路(dijkstra))
- hdu1595(枚举+最短路,Dijkstra/SPFA)
- hdu1595
- HDU1595
- HDU1595
- 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 (dijkstra+记录路径)
- hdu1595—find the longest of the shortest(dijkstra+枚举)
- (spfa记录路径)hdu1595+hdu3986
- dijkstra
- dijkstra
- Dijkstra
- Dijkstra
- DIJKSTRA
- 基于PhoneGap的Windows Phone平台环境搭建教程
- git基本使用
- OLTP和OLAP
- poj 3264 RMQ 基本应用
- C++字符串数字相互转换
- hdu1595 dijkstra
- JavaScript调用dll的公用方法
- cocos2d-x在vs2010中的配置
- NMap
- win7配置IIS(二)之常见错误解决方案
- 对于DSP来说,emulator和simulator到底有和不同,全面解析
- HTML5 Canvas游戏开发实战
- android View.setTag()与View.getTag()的作用
- Visio虚线复制到word中变为实线问题的解决办法