POJ 3615 Cow Hurdles.
来源:互联网 发布:徒步计步器软件 编辑:程序博客网 时间:2024/04/29 22:35
Description
Farmer John wants the cows to prepare for the county jumping competition, so Bessie and the gang are practicing jumping over hurdles. They are getting tired, though, so they want to be able to use as little energy as possible to jump over the hurdles.
Obviously, it is not very difficult for a cow to jump over several very short hurdles, but one tall hurdle can be very stressful. Thus, the cows are only concerned about the height of the tallest hurdle they have to jump over.
The cows' practice room has N (1 ≤ N ≤ 300) stations, conveniently labeled 1..N. A set of M (1 ≤ M ≤ 25,000) one-way paths connects pairs of stations; the paths are also conveniently labeled 1..M. Path i travels from station Si to station Ei and contains exactly one hurdle of height Hi (1 ≤ Hi ≤ 1,000,000). Cows must jump hurdles in any path they traverse.
The cows have T (1 ≤ T ≤ 40,000) tasks to complete. Task i comprises two distinct numbers, Ai and Bi (1 ≤ Ai ≤ N; 1 ≤ Bi ≤ N), which connote that a cow has to travel from station Ai to station Bi (by traversing over one or more paths over some route). The cows want to take a path the minimizes the height of the tallest hurdle they jump over when traveling from Ai to Bi . Your job is to write a program that determines the path whose tallest hurdle is smallest and report that height.
Input
* Line 1: Three space-separated integers: N, M, and T
* Lines 2..M+1: Line i+1 contains three space-separated integers: Si , Ei , and Hi
* Lines M+2..M+T+1: Line i+M+1 contains two space-separated integers that describe task i: Ai and Bi
Output
* Lines 1..T: Line i contains the result for task i and tells the smallest possible maximum height necessary to travel between the stations. Output -1 if it is impossible to travel between the two stations.
Sample Input
5 6 31 2 123 2 81 3 52 5 33 4 42 4 83 41 25 1
Sample Output
48-1
Source
====
Floyd算法的变形,是找从A到B的所有路径中的最小的最大高度。
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;const int N=305;const int INF=0x3f3f3f3f;int n,m,t,s,e;int d[N][N];void Floyd(){ for(int k=1;k<=n;k++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) d[i][j]=min(d[i][j],max(d[i][k],d[k][j])); //注意这里的写法。}int main(){ scanf("%d%d%d",&n,&m,&t); memset(d,0x3f,sizeof(d)); int p,q,v; for(int i=0;i<m;i++) { scanf("%d%d%d",&p,&q,&v); d[p][q]=v; } Floyd(); for(int i=1;i<=t;i++) { scanf("%d%d",&s,&e); int ans=d[s][e]; if(ans==INF) printf("-1\n"); else printf("%d\n",ans); } return 0;}
- POJ 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- POJ 3615 Cow Hurdles.
- POJ -- 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- POJ--3615|Cow Hurdles
- POJ 3615 Cow Hurdles
- poj 3615 Cow Hurdles floyed
- [floyd]POJ 3615 Cow Hurdles
- poj 3615Cow Hurdles floyd
- Poj 3615 Cow Hurdles【Floyd】
- poj 3615 :Cow Hurdles (floyd)----很好
- poj 3615(Cow Hurdles) floy 算法
- typedef 名称[C++ prime]
- 微信公众平台开发入门教程
- 3.8 MonoForAndroid用户人机界面-手机页面的转换
- 720P不是高清,可算准高清
- css盒子模型
- POJ 3615 Cow Hurdles.
- 项目管理能力提升四要素
- 静语流年,凝眸时光
- Java 之 System.getProperty()常用值
- hibernate继承映射详解
- sizeof总结
- java多线程之路之线程同步—Core Java学习
- Android Bitmap 与 Drawable之间的转换
- 全局变量和局部变量在内存里的区别