SEA7236_저수지의 물의 총 깊이 구하기

https://www.swexpertacademy.com/main/code/userProblem/userProblemDetail.do?contestProbId=AWlTKTUqCN8DFAVS&categoryId=AWlTKTUqCN8DFAVS&categoryType=CODE

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
 
public class Solution {
    
    static int[] dx = {-1,0,1,0,1,1,-1,-1};
    static int[] dy = {0,-1,0,1,-1,1,1,-1};
    static int cnt;
 
    public static void main(String[] args) throws Exception {
        
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        int test_case = Integer.parseInt(br.readLine().trim());
        for (int tc = 1; tc <= test_case; tc++) {
            
            int N = Integer.parseInt(br.readLine().trim());
            //String[][] map = new String[N][N];
            char[][] map = new char[N][N];
            
            for (int i = 0; i < N; i++) {
                //StringTokenizer st = new StringTokenizer(br.readLine().trim(), " ");
                String[] s = br.readLine().split(" ");
                //System.out.println(Arrays.toString(s));
                for (int j = 0; j < N; j++) {
                    //map[i][j] = st.nextToken();
                    map[i][j] = s[j].charAt(0);
                }
            }
            
            int max = 0;
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    cnt = 0;
                    // 현재 값이 물일때만
                    if(map[i][j] == 'W') {
                        solve(map, i, j, N);
                    }
                    if(max < cnt) {
                        max = cnt;
                    }
                }
            }
            if(max <= 0) {
                System.out.println("#" + tc + " " + 1);
            }
            else {
                System.out.println("#" + tc + " " + max);
            }
        } // end of tc
        
    } // end of main
 
    private static void solve(char[][] map, int x, int y, int size) {
        
        for (int i = 0; i < 8; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            if(nx>=0 && nx<size && ny>=0 && ny<size) {
                // 주변이 물일때만 ++
                if(map[nx][ny] == 'W') {
                    cnt++;
                }
            }
        }
        
    } // end of solve
} // end of class