[BOJ] 4920 테트리스 게임

모든 도형의 좌표를 지정해주고 탐색해서 풀었다...

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Solution4920 {

    static int[][][] figure = {
        {
            {0, 0, 0, 0}, {0, 1, 2, 3}
        },
        {
            {0, 1, 2, 3}, {0, 0, 0, 0}
        },

        {
            {0, 0, 1, 1}, {0, 1, 1, 2}
        },
        {
            {0, 1, 1, 2}, {0, 0, -1, -1}
        },

        {
            {0, 0, 0, 1}, {0, 1, 2, 2}
        },
        {
            {0, 1, 2, 2}, {0, 0, 0, -1}
        },
        {
            {0, 1, 1, 1}, {0, 0, 1, 2}
        },
        {
            {0, 0, 1, 2}, {0, 1, 0, 0}
        },

        {
            {0, 1, 1, 1}, {0, -1, 0, 1}
        },
        {
            {0, 1, 1, 2}, {0, 0, 1, 0}
        },
        {
            {0, 0, 0, 1}, {0, 1, 2, 1}
        },
        {
            {0, 1, 1, 2}, {0, -1, 0, 0}
        },

        {
            {0, 0, 1, 1}, {0, 1, 1, 0}
        },

    };
    static int[][] map;
    static int N;


    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int input = 1;
        while ((N = Integer.parseInt(br.readLine().trim())) != 0) {
            map = new int[N][N];
            int max = Integer.MIN_VALUE;
            for (int i = 0; i < N; i++) {
                StringTokenizer st = new StringTokenizer(br.readLine().trim());
                for (int j = 0; j < N; j++) {
                    map[i][j] = Integer.parseInt(st.nextToken());
                }
            }
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    for (int a = 0; a < figure.length; a++) {
                        int sum = 0;
                        boolean flag = true;
                        for (int b = 0; b < 4; b++) {
                            int nx = i + figure[a][0][b];
                            int ny = j + figure[a][1][b];
                            if (nx >= 0 && nx < N && ny >= 0 && ny < N) {
                                sum += map[nx][ny];
                            } else {
                                flag = false;
                                break;
                            }
                        }
                        if (flag) {
                            max = Math.max(max, sum);
                        }
                    }
                }
            }
            System.out.println(input + ". " + max);
            input++;
        }
    }
}