码迷,mamicode.com
首页 >  
搜索关键字:lift hopping    ( 171个结果
many trucking companies
Cina. The other type of bucket trucks that is also widely used is the Elevating Work Platforms or most commonly known as scissor lift is one type of p...
分类:其他好文   时间:2014-08-21 09:43:53    阅读次数:294
【UVA】821-Page Hopping(Floyd)
模板题,求一个点到任何一点的距离,用Floyd就行了,结点不一定是从1 ~ n 的,所以需要记录结点的id 14063895 821 Page Hopping Accepted C++ 0.119 2014-08-19 10:00:27 #include #include #include #include #includ...
分类:其他好文   时间:2014-08-19 19:07:25    阅读次数:237
HDU 1548 (最基础的BFS了) A strange lift
这是一维的BFS,而且没有什么变形,应该是最基础的BFS了吧题意:有这样一个奇葩的电梯,你在第i层的时候你只能选择上或者下Ki层,也就是你只能从第i层到达i+Ki或者i-Ki层。当然电梯最低只能在1层最高只能在n层。给出起点和终点问最少需要多少次才能到达终点,如果不能到达输出-1没有什么好解释的了,...
分类:其他好文   时间:2014-08-16 17:06:10    阅读次数:251
HDU1548:A strange lift(Dijkstra或BFS)
题目链接http://acm.hdu.edu.cn/showproblem.php?pid=1548题意:电梯每层有一个数,例如第n层有个数k,那么这一层只能上k层或下k层,但是不能低于一层或高于n层,给定起点与终点,要求出最少要按几次键我的思路:这题可以用bfs或者用最短路(dijsktra)bf...
分类:其他好文   时间:2014-08-15 12:30:18    阅读次数:205
hdu 1548 A strange lift (dijkstra算法)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1548题目大意:升降电梯,先给出n层楼,然后给出起始的位置,即使输出从A楼道B楼的最短时间。注意的几点(1)每次按一下,只能表示上或者是下,然后根据输入的看是上几层或者是下几层。(2)注意不能到底不存在的...
分类:其他好文   时间:2014-08-14 20:13:19    阅读次数:211
where the lift is not completely lowered or raised
Questa societ che aveva iniziato piccola ben presto tr . Additionally, when constructing scaffolding, netting and/or guard rails may be used for extra...
分类:其他好文   时间:2014-08-14 13:49:58    阅读次数:329
Lift Tables are also termed as Cherry Picker
Added here is the fact that even the professional workmen are prone to face this sort of danger any time during the construction process. However, lit...
分类:其他好文   时间:2014-08-14 13:32:38    阅读次数:285
HDU1548A strange lift(搜索)
A strange lift Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11649    Accepted Submission(s): 4419 Problem Description There is a s...
分类:其他好文   时间:2014-08-14 10:57:58    阅读次数:252
hdu
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1548题目意思:给出 n 个 floor 你,每个floor 有一个数k,按下它可以到达 floor + k 或者 floor - k的位置。问从floor A 到 floor B 最少的按lift 次数...
分类:其他好文   时间:2014-08-12 00:31:23    阅读次数:122
hdu1548 A strange lift(bfs 或Dijkstra最短路径)
1 #include 2 #include 3 #include 4 #include 5 #define M 205 6 #define INF 0x3f3f3f3f 7 using namespace std; 8 9 int map[M][M];10 int d[M], vis[M];11.....
分类:其他好文   时间:2014-08-11 14:57:22    阅读次数:276
171条   上一页 1 ... 14 15 16 17 18 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!