F - A strange lift （bfs&Dijkstra）

$Description$
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”.

• bfs

import java.util.PriorityQueue;
import java.util.Scanner;

public class Main{
	/*
	 * [7.20~7.26] 图的基本应用
	 * F - A strange lift 
	 * （bfs&Dijkstra）
	 */
	static int n,m,M=210,x,y,a,b;
	static int k[];
	static int num,sum;
	static final int MAX_VALUE=Integer.MAX_VALUE;
	static String s[];
	static boolean vis[];
	
	public static void main(String []args) {
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()) {
			n=sc.nextInt();
			if(n==0)break;
			k=new int [n+1];
			vis=new boolean [n+1];
			a=sc.nextInt();
			b=sc.nextInt();
			for(int i=1;i<=n;i++) {
				k[i]=sc.nextInt();
			}
			bfs();
		}
	}
	static void bfs() {
		if(a==b) {
			System.out.println(0);
			return ;
		}
		PriorityQueue<node>q=new PriorityQueue<node>();
		q.add(new node(a,0));
		node no;
		int flag=-1;
		while(!q.isEmpty()) {
			no=q.poll();
			if(vis[no.num]) continue;
			vis[no.num]=true;
			x= no.num+k[no.num];
			if(x==b) {
				flag=no.cnt+1;
				break;
			}else if(x<=n){
				q.add(new node(x,no.cnt+1));
			}
			
			x=no.num-k[no.num];
			if(x==b) {
				flag=no.cnt+1;
				break;
			}else if(x>=1){
				q.add(new node(x,no.cnt+1));
			}
		}
		System.out.println(flag);
	}
	static class node implements Comparable<node>{
		int cnt,num;
		public node(int a,int b) {
			num=a;cnt=b;
		}
		public int compareTo(node o) {
			return this.cnt-o.cnt;
		}
	}
}
/*
5 1 5
3 3 1 2 5
3 2 3
3 2 1
0

3
-1
3 2 3
3 2 1

 */

#include<stdio.h>
#include<limits.h>
#include<iostream>
#include<string.h>
#define MAXN 200
using namespace std;
int edge[MAXN+10][MAXN+10];
int dis[MAXN+10];
bool vis[MAXN+10];
int T,S,D,N,k;
void dijkstra(int begin)
{
    memset(vis,0,sizeof(vis));
    for (int i=1; i<=T; i++)
        dis[i]=INT_MAX;
    dis[begin]=0;
    for (int t=1; t<=T; t++)
    {
        vis[begin]=1;
        for (int i=1; i<=T; i++)
            if (!vis[i]&&edge[begin][i]!=INT_MAX&&dis[begin]+edge[begin][i]<dis[i])
                dis[i]=dis[begin]+edge[begin][i];
        int min=INT_MAX;
        for (int j=1; j<=T; j++)
            if (!vis[j]&&min>dis[j])
            {
                min=dis[j];
                begin=j;
            }
    }
}
int main()
{
    int begin,end;
    while (cin>>T)
    {
        if (T==0) break;
        for (int i=1;i<=MAXN;i++)
            for (int j=1;j<=MAXN;j++)
                edge[i][j]=INT_MAX;
        scanf("%d %d",&begin,&end);
        int t;
        for (int i=1;i<=T;i++)
        {
            scanf("%d",&t); //注意是有向图！一开始因为这个WA了好几次。
            if (i+t<=T) edge[i][i+t]=1;
            if (i-t>=1) edge[i][i-t]=1;
        }
        dijkstra(begin);
        if (dis[end]!=INT_MAX) printf("%d\n",dis[end]);
        else printf("-1\n");
    }
    return 0;
}