find the longest of the shortest 最短路径 dijkstra
来源:互联网 发布:node 高手训练营 编辑:程序博客网 时间:2024/05/20 10:55
find the longest of the shortest
Time Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/OtheTotal Submission(s): 3448 Accepted Submission(s): 1289
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.
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.
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
111327
题意:城市内有n条路,其中有某条路在修,因为这条路有很多情况,问各种情况下的最短路中最长的是哪条;
思路:直接枚举所有情况算出最大值即可
#include <iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#define N 1100
#define INF 0x7ffffff
using namespace std;
int d[N],pre[N],v[N],n,m,mp[N][N];
void dijkstra(int c)
{
for(int i=0;i<=n;i++) d[i]=INF,v[i]=0;
d[1]=0;
for(int i=1;i<=n;i++)
{
int t=-1,mmin=INF;
for(int j=1;j<=n;j++)
if(!v[j]&&mmin>d[j])
mmin=d[t=j];
if(t==-1) break;
v[t]=1;
for(int j=1;j<=n;j++)
if(d[j]>d[t]+mp[t][j])
{
d[j]=d[t]+mp[t][j];
if(c) pre[j]=t;
}
}
}
int main()
{
while(~scanf("%d%d",&n,&m))
{
for(int i=0;i<=n;i++)
for(int j=0;j<=n;j++)
mp[i][j]=INF;
for(int i=0;i<m;i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
mp[u][v]=mp[v][u]=w;
}
memset(pre,-1,sizeof(pre));
dijkstra(1);
int ans=d[n];
//从最后开始向前枚举
for(int i=n;i!=1;i=pre[i])
{
int t=mp[i][pre[i]];//保留
mp[i][pre[i]]=mp[pre[i]][i]=INF;//不能过
dijkstra(0);
if(d[n]>ans) ans=d[n];
mp[i][pre[i]]=mp[pre[i]][i]=t;//复原
}
cout<<ans<<endl;
}
}
- find the longest of the shortest 最短路径 dijkstra
- HDU1595 find the longest of the shortest(最短路,Dijkstra)
- 杭电-1595find the longest of the shortest(记录路径最短路径中最长路)
- hdu 1595 find the longest of the shortest(spfa)(存储并枚举最短路径的边)
- hdu1595 find the longest of the shortest (dijkstra+记录路径)
- hdu 1595 find the longest of the shortest (Dijkstra+路径处理)
- HDU1595:find the longest of the shortest(Dijkstra)
- HDU 1595 find the longest of the shortest(Dijkstra)
- hdu1595 find the longest of the shortest(Dijkstra)
- HDU1595:find the longest of the shortest(Dijkstra)
- HDU 1595 find the longest of the shortest (Dijkstra)
- hdu 1595 find the longest of the shortest (dijkstra)
- hdu 1595 find the longest of the shortest (dijkstra + spfa)
- hdu 1595 find the longest of the shortest(dijkstra)
- HDU 1595 find the longest of the shortest (Dijkstra算法)
- hdu 1595 find the longest of the shortest (Dijkstra)
- HDU - 1595 find the longest of the shortest(最短路Dijkstra+枚举删边)
- hdu 1595 find the longest of the shortest 最短路dijkstra+枚举
- 相关滤波目标跟踪学习笔记(一)——研究历史及现状
- Codeforces Round #427 (Div.2) A
- 播放音/视频
- arm交叉编译 sshd服务器让外界登陆。
- python如何获取网络上的图片并将其保存在本地
- find the longest of the shortest 最短路径 dijkstra
- MySQL数据类型
- Linux 查看端口占用情况
- let's shell---rm -rf 命令居然删除目录失败
- 类于类之间的关系--继承、实现、依赖、关联、聚合、组合的联系与区别
- JavaScript难点(一)
- JS循环结构5
- RabbitMQ远程访问
- java反射与注解