[코트드리/Java] 최적의 십자 모양 폭발

풀이🛫 import java.util.Scanner; public class Main { public static final int DIR_NUM = 4; public static final int MAX_N = 50; public static final int[] dx = new int[]{-1,0,1,0}; public static final int[] dy = new int[]{0,1,0,-1}; public static int n, ans; public static int[][] orgGrid = new int[MAX_N][MAX_N]; public static int[][] grid = new int[MAX_N][MAX_N]; public static int[][] temp = new int[M..