hdu1584 A strange lift (电梯最短路径问题)
A strange lift
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15570 Accepted Submission(s): 5832
go to the i+Ki th floor,as the same, if you press the button "DOWN" , you will go down Ki floor,i.e,you will go to the i-Ki th floor. Of course, the lift can't go up high than N,and can't go down lower than 1. For example, there is a buliding with 5 floors,
and k1 = 3, k2 = 3,k3 = 1,k4 = 2, k5 = 5.Begining from the 1 st floor,you can press the button "UP", and you'll go up to the 4 th floor,and if you press the button "DOWN", the lift can't do it, because it can't go down to the -2 th floor,as you know ,the -2
th floor isn't exist.
Here comes the problem: when you are on floor A,and you want to go to floor B,how many times at least he has to press the button "UP" or "DOWN"?
The first line contains three integers N ,A,B( 1 <= N,A,B <= 200) which describe above,The second line consist N integers k1,k2,....kn.
A single 0 indicate the end of the input.
5 1 5
3 3 1 2 5
0
3
pid=1142" style="color:rgb(26,92,200); text-decoration:none">1142
1217 1253Statistic | pid=1548" style="color:rgb(26,92,200); text-decoration:none">Submit problemid=1548" style="color:rgb(26,92,200); text-decoration:none">Discuss pid=1548" style="color:rgb(26,92,200); text-decoration:none">Note
电梯仅仅有两个方向,向上或者向下。既然是求最短路径。也就用到dijkstra算法(无负权值)。
仅仅要能想到怎样构造算法即可。假设自己的算法,却不知道怎样用来解题,也都是没用的。
在这里我想给大家说一下。
在以后做题的过程中,不要仅仅看别人的代码,要看思想,别人为什么这样写。然后依据自己想象的思想写一遍代码。写的过程中不要
看别人的代码。即使不正确也无所谓,这样印象最深,以后也就随手敲来、
详细还是代码里面见:
#include <stdio.h>
#include<string.h>
#include <queue>
using namespace std;
struct node
{
int pos,t;
friend bool operator<(node a,node b)
{
return a.t>b.t;
}
};
priority_queue<node>s;
int lift[205],vis[205],n;
int dijkstra(int st,int ed)
{
node temp,temp1;
int flag=0;
temp.pos=st,temp.t=0;
s.push(temp);
while(!s.empty())
{
temp1=temp=s.top(),s.pop();
vis[temp.pos]=1;
if(temp.pos==ed)
{
flag=1;
break;
}
temp.pos=temp1.pos-lift[temp1.pos];//
temp.t=temp1.t+1;
if(temp.pos>=1&&temp.pos<=n&&!vis[temp.pos])
s.push(temp);
temp.pos=temp1.pos+lift[temp1.pos];
temp.t=temp1.t+1;
if(temp.pos>=1&&temp.pos<=n&&!vis[temp.pos])
s.push(temp);//和以往的代码不同的也就这个地方。曾经做的要么是个矩阵,要么是个树,如今就两个方向了。。推断电梯的
这两个方向,进队列即可了
}
if(flag)
return temp.t;
else
return -1;
}
int main()
{
int st,ed;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
scanf("%d %d",&st,&ed);
for(int i=1;i<=n;i++)
scanf("%d",&lift[i]);
memset(vis,0,sizeof(vis));
while(!s.empty())
s.pop();
printf("%d\n",dijkstra(st,ed));
}
return 0;
}
hdu1584 A strange lift (电梯最短路径问题)的更多相关文章
- HDU1548——A strange lift(最短路径:dijkstra算法)
A strange lift DescriptionThere is a strange lift.The lift can stop can at every floor as you want, ...
- HDU 1548 A strange lift (最短路/Dijkstra)
题目链接: 传送门 A strange lift Time Limit: 1000MS Memory Limit: 32768 K Description There is a strange ...
- HDU 1548 A strange lift (bfs / 最短路)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1548 A strange lift Time Limit: 2000/1000 MS (Java/Ot ...
- hdu 1548 A strange lift (bfs)
A strange lift Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) T ...
- A strange lift
Problem Description There is a strange lift.The lift can stop can at every floor as you want, and th ...
- A strange lift HDU - 1548
There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 ...
- HDU-1548 A strange lift(单源最短路 或 BFS)
Problem Description There is a strange lift.The lift can stop can at every floor as you want, and th ...
- Hdu1548 A strange lift 2017-01-17 10:34 35人阅读 评论(0) 收藏
A strange lift Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Tota ...
- HDU 1548 A strange lift (广搜)
题目链接 Problem Description There is a strange lift.The lift can stop can at every floor as you want, a ...
随机推荐
- 服务认证暴力破解工具Crowbar
服务认证暴力破解工具Crowbar Crowbar是Kali Linux新增的一款服务认证暴力破解工具.该工具支持OpenVPN.RDP.SSH和VNC服务.该工具具备常见的暴力破解功能,如主机字 ...
- [xsy2164]theory
又积累了一个网络流模型:最大权闭合子图,相关证明去看论文,感觉自己不是很懂证明,但现在还是先把建模记下来再说吧 枚举一个点,硬点它一定要被选中,那么以它为根,如果选了$x$就必须要选$fa_x$,这就 ...
- mac Nginx + FastCgi + Spawn-fcgi + c++
1.安装要用到的库 brew install lighttpd brew install nginx brew install Spawn-fcgi //----------------------- ...
- Problem G: 零起点学算法27——等级分制度
#include<stdio.h> int main() { int a,b; while(scanf("%d %d",&a,&b)!=EOF) +a* ...
- FireDac Pooling
1.建立FDManager的ConnectionDef.并设置此Pooling为True. 2.建立Thread类进行多个FDConnection连接DB. 3.本列是oracle远程数据.如下图: ...
- 将Java程序打jar包并运行
1)接着上篇博客继续说手动编译之后,将代码打成jar包,然后直接“java -jar lz.jar"运行不成功的问题.还是先上代码: 这个是Demo类: package org.lz.dem ...
- Scala零基础教学【102-111】Akka 实战-深入解析
第102讲:通过案例解析Akka中的Actor运行机制以及Actor的生命周期 Actor是构建akka程序的核心基石,akka中actor提供了构建可伸缩的,容错的,分布式的应用程序的基本抽象, a ...
- 动态OSPF配置路由表
动态ospf设置路由表 以Rourer1为例子 (1)首先设置路由器端口ip Router(config)#inter f0/0 Router(config-if)#ip add 192.168.1. ...
- Ubuntu 16.04使用rm -rf误删文件恢复方法收集
说明:不一定有效,需要不断尝试 一.lsof 文件刚刚被删除,想要恢复,先尝试lsof. lsof |grep data.file1 cp /proc/xxx/xxx/xx /dir/data.fil ...
- nginx做反向代理时获取真实IP
原文:http://blog.csdn.net/aquester/article/details/48657395 1. 编译 对于client -> nginx reverse proxy - ...