poj2386C语言解题报告
#includechar mi[1000][1000];int arr[1000][1000];void dfs(int x,int y){// if(arr[x+1][y]=='W'||arr[x+1][y+1]=='W'||arr[x-1][y]=='W'||arr[x-1][y-1]=='W'||arr[x][y+1]=='W'||arr[x][y-1]=='W'||arr[x+1
