Link2468번 - 안전 영역 문제풀이(1) DFS 재귀 구현let input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n");let idx = 0;const N = Number(input[idx++]);const map = [];let maxAnswer = 0;const dn = [0, 1, 0, -1];const dm = [1, 0, -1, 0];for (let n = 0; n { return n = N || m >= N;};const dfsRecursive = (n, m, visited, value) => { visited[n][m] = true; for (let d = 0; d Array.from({..