[HDU 1548] SPFA 最短路权值设为1， 然后求a--b的最短路

#include <bits/stdc++.h>
#define inf 9999999 
using namespace std ;
int a , b , n ,s , t ,dis[2000] , ma[2000][2000] , vis[2000];
void init();
void spfa()
{
	queue<int>Q;
	dis[a] = 0 ;
	vis[a] = 1 ;
	Q.push(a);
	while(!Q.empty())
	{
		int now = Q.front();
		Q.pop();
		vis[now] = 0 ;
		for(int i = 1 ; i <=n ; i++)
		{
			if(dis[i] > dis[now] + ma[now][i])
			{
				dis[i]  =  dis[now] + ma[now][i];
				if(!vis[i])
				{
					Q.push(i);
					vis[i] = 1 ;
				}
			} 
		}
	}
}
int main()
{
	while(scanf("%d",&n)!=EOF&&n!=0)
	{
		init();
		scanf("%d%d",&a,&b);
		for(int i = 1 ; i <=n ; i++)
		{
			int k ;
			scanf("%d",&k);
			if(i+k<=n)
			{
				ma[i][i+k] = 1 ;
			}
			if(i-k>=1)
			{
				ma[i][i-k] = 1 ;
			}
		}
		spfa();
		if(dis[b] < inf )  printf("%d\n",dis[b]);
		else printf("-1\n");
	}
	return 0 ;	
}

void init()
{
	for(int i = 0 ; i <=n; i++)
	{
		for(int j = 0 ; j<=n ; j++)
		{
			ma[i][j] = inf ;
		}
		ma[i][i] = 0 ;
		vis[i] = 0 ;
		dis[i] = inf ;
	}
}