HDU-1548 A strange lift (DFS)

There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When you at floor i,if you press the button "UP" , you will go up Ki floor,i.e,you will 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"? 

Input

The input consists of several test cases.,Each test case contains two lines. 
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.

Output

For each case of the input output a interger, the least times you have to press the button when you on floor A,and you want to go to floor B.If you can't reach floor B,printf "-1".

Sample Input

5 1 5
3 3 1 2 5
0

Sample Output

3

 

wa了几下 刚开始不知道怎么处理如果找不到得状态

后来发现 比如说now是在第5步到达的话先记录下 同时也表示走过  以后若是有超过的话 那么就直接return了

代码:

import java.util.Scanner;
import java.util.Arrays;
public class Main {
	static Scanner sc = new Scanner(System.in);
	static int total,A,B;
	static int floor[] = new int[205];
	static int vis[] = new int[205];
	static int maxn = Integer.MAX_VALUE;
	static void DFS(int now , int cnt)
	{
		if(now == B){
			maxn = Integer.min(cnt, maxn);
			return;
		}
		if(cnt >= vis[now])
			return ;
		vis[now] = cnt;
		if(now + floor[now] <= total)
			DFS(now + floor[now],cnt + 1);
		if(now - floor[now] >= 1)
			DFS(now - floor[now],cnt + 1);
		return ;
	}
	public static void main(String[] args) {
		while(sc.hasNext())
		{
			total = sc.nextInt();
			if(total == 0)
				break;
			A = sc.nextInt();
			B = sc.nextInt();
			for(int i = 1; i <= total; i ++)
				floor[i] = sc.nextInt();
			maxn = Integer.MAX_VALUE;
			Arrays.fill(vis, Integer.MAX_VALUE);
			DFS(A,0);//表示现在在哪里  按了几下了;
			if(maxn == Integer.MAX_VALUE)
				maxn = -1;
			System.out.println(maxn);
		}
	}
}

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值