三解炸弹人——DFS

import java.util.*;

public class bomb_Three {
    
    static int n;    //行
    static int m;    //列
    static int save_x;
    static int save_y;
    static int max=0;
    static int dir[][]= {{0,1},{1,0},{0,-1},{-1,0}};    //右、下、左、上
    static char maze[][];
    static int book[][];    //标记数组
    
    static void Total(int x,int y) {    //统计灭敌数
        
        int dx=x;
        int dy=y;
        int num=0;
        while(maze[dx][dy]!=‘#‘) {    //右
            if(maze[dx][dy]==‘G‘) {
                num++;
            }
            dy++;
        }
        dx=x;
        dy=y;
        while(maze[dx][dy]!=‘#‘) {    //下
            if(maze[dx][dy]==‘G‘) {
                num++;
            }
            dx++;
        }
        dx=x;
        dy=y;
        while(maze[dx][dy]!=‘#‘) {    //左
            if(maze[dx][dy]==‘G‘) {
                num++;
            }
            dy--;
        }
        dx=x;
        dy=y;
        while(maze[dx][dy]!=‘#‘) {    //上
            if(maze[dx][dy]==‘G‘) {
                num++;
            }
            dx--;
        }
        if(num>max) {
            max=num;
            save_x=x;
            save_y=y;
        }
        
    }
    
    static void DFS(int x,int y) {
        
        for(int i=0;i<4;i++) {
            int dx=x+dir[i][0];
            int dy=y+dir[i][1];
            if(dx<0 || dx>n || dy<0 || dy>m) {
                continue;
            }
            if(maze[dx][dy]!=‘.‘ || book[dx][dy]==1) {
                continue;
            }
            Total(dx,dy);
            book[dx][dy]=1;
            DFS(dx,dy);
            book[dx][dy]=0;    //回溯
        }
        
    }

    public static void main(String[] args) {
        
        Scanner reader=new Scanner(System.in);
        n=reader.nextInt();
        m=reader.nextInt();
        maze=new char[n][m];
        book=new int[n][m];
        int start_x=reader.nextInt();    //炸弹人初始位置
        int start_y=reader.nextInt();
        for(int i=0;i<n;i++) {
            String ss=reader.next();
            maze[i]=ss.toCharArray();
        }
        for(int i=0;i<n;i++) {
            for(int j=0;j<m;j++) {
                book[i][j]=0;
            }
        }
        Total(start_x,start_y);
        DFS(start_x,start_y);
        System.out.println("("+save_x+","+save_y+")"+" "+max);
    }

}