廣度優先搜索

#include<stdio.h> struct note{ int x; int y; }; int main(){ int m,n,startx,starty; int tx,ty; int a[51][51]; int book[51][51]={0}; int sum = 1; note que[2501]; scanf("%d%d%d%d",&m,&n,&startx,

>>阅读原文<<