[HDU1548] A strange lift [单源最短路/BFS]

建图然后跑最短路，注意无解。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<ctime>
#include<queue>
using namespace std;
#define add_edge(a,b) nxt[++tot]=head[a],head[a]=tot,to[tot]=b
#define PII pair<int,int>
priority_queue<PII,vector<PII>,greater<PII> >Q;
int N,A,B,tot=0;
int head[205]={},to[405]={},nxt[405]={},dis[205]={};
bool vis[205]={};
int dij()
{
	Q.push(make_pair(0,A)), dis[A]=0;
	while(!Q.empty())
	{
		int x=Q.top().second; Q.pop();
		vis[x]=1;
		for(int i=head[x];i;i=nxt[i])
		{
			if(dis[x]+1<dis[to[i]])
			{
				dis[to[i]]=dis[x]+1;
				if(!vis[to[i]])Q.push(make_pair(dis[to[i]],to[i]));
			}
		}
	}
	return vis[B]?dis[B]:-1;
}
int main()
{
	while((~scanf("%d",&N))&&N)
	{
		scanf("%d%d",&A,&B);
		tot=0;
		for(int k,i=1;i<=N;++i)
		{
			scanf("%d",&k);
			head[i]=vis[i]=0;
			dis[i]=0x3f3f3f3f;
			if(i-k>=1)add_edge(i,i-k);
			if(i+k<=N)add_edge(i,i+k);
		}
		printf("%d\n",dij());
	}
	return 0;
}

$BFS$也可以。建图然后跑。剪枝。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<ctime>
#include<queue>
using namespace std;
#define add_edge(a,b) nxt[++tot]=head[a],head[a]=tot,to[tot]=b
queue<pair<int,int> >Q;
int N,A,B,tot=0;
int head[205]={},to[405]={},nxt[405]={};
bool vis[205]={};
int bfs()
{
	while(!Q.empty())Q.pop();
	Q.push(make_pair(0,A));
	while(!Q.empty())
	{
		pair<int,int> x=Q.front(); Q.pop();
		
		if(x.first>=N)return -1; 
		if(x.second==B)return x.first;
		
		vis[x.second]=1;
		
		for(int i=head[x.second];i;i=nxt[i])
		if(!vis[to[i]])Q.push(make_pair(x.first+1,to[i]));
	}
	return -1;
}
int main()
{
	while((~scanf("%d",&N))&&N)
	{
		scanf("%d%d",&A,&B);
		tot=0;
		for(int k,i=1;i<=N;++i)
		{
			scanf("%d",&k);
			head[i]=vis[i]=0;
			if(i-k>=1)add_edge(i,i-k);
			if(i+k<=N)add_edge(i,i+k);
		}
		printf("%d\n",bfs());
	}
	return 0;
}