宽度优先搜索搜索系列一

http://poj.org/problem?id=3278简单的搜索问题，一维坐标内宽搜，结果就是短的时间。注意有效性判断#include #include #include #include using namespace std;int maze[100001],time[100001];int n,m,i,temp;bool check(int d){if(d>=0&&d<=100000&&!maze[d]){return true;} return false;}void bfs(int d){int next[3];memset(maze,0,sizeof(maze));memset(time,0,sizeof(time));queueq;q.push(n);time[n]=0;maze[n]=1;while(!q.empty()){ temp=q.front();q.pop();if(temp==m){break;}next[0]=temp-1; next[1]=temp+1; next[2]=temp*2;for(i=0;i<3;i++){ int nextpoint=next[i];if(check(nextpoint)){time[nextpoint]=time[temp]+1;maze[nextpoint]=1;q.push(nextpoint);}}}}int main(){while(scanf("%d%d",&n,&m)!=EOF){bfs(n);cout<<time[m]<<endl;}return 0;}