Dr.kong的机器人.doc

// Dr. Kong 的机器人 //================================ #define M 8 #define N 50 #include “stdio.h” typedef struct { int pos; int step } Tnode ; //================================ int main( ) { int A, B, i, j; m, n; int r, here, new, p2, p1; int k[N+1]; int flag[N+1]; Tnode Q[N+1]; scanf(“%d”, m); for(i=1; i=m; ++i) { scanf(“%d %d %d”,n,A,B); for(j=1; j=n; ++j) scanf(“%d”,k[j]); if(A==B) { printf(“%d\n”, 0); continue; } for(j=1; j=n; ++j) flag[j]=0; flag[A]=1; //起点进队 p1=0; p2=1; Q[p1].pos=A ; Q[p1].step=0; while(p1p2) //队不空 { here=Q[p1].pos; for(r=1;r=2; ++r) { if (r==1) new=here+k[here]; else new=here-k[here]; if (new==B) { printf(“%d\n”,Q[p1].step+1); break; } if ((new=n)!flag[new]) { flag[new]=1; Q[p2].pos=new; Q[p2].step=Q[p1.step+1; ++p2; //进队 } } //r if(r=2) break; ++p1; //出队 }//while if (r2) printf(“-1”); } //for return 1; }