在长度为n的坐标轴上,从A点移动到B点的最少步数
1,向前一步,坐标加1;
2,向后一步,坐标减1;
3,跳跃一步,坐标承2;
第一行输入,n,A,B,代表坐标轴长度,起始点坐标,终点坐标;
0<=A,B,<=n<=5000;
例
输入
10 2 7
输出
3
#include <iostream>
#include <queue>
using namespace std;
queue<pair<int ,int> >q;
bool vis[5005];
int main ()
{
int n,A,B;
int now;
int step;
scanf ("%d%d%d",&n,&A,&B);
q.push(make_pair(A,0));
vis[A]=true;
while (!q.empty()){
now = q.front().first;
step =q.front().second;
q.pop();
if (now==B)
{
printf ("%d\n",step);
break;
}
if (now+1<=n&&!vis[now+1]){
q.push(make_pair(now+1,step+1));
vis[now+1]=true;
}
if (now-1>=0&&!vis[now-1]){
q.push(make_pair(now-1,step-1));
vis[now-1]=true;
}
if (now*2<=n&&!vis[now*2]){
q.push(make_pair(now*2,step+1));
vis[now*2]=true;
}
}
return 0;
}
欢迎关注我的公众号:王同学的蓝桥杯训练营