문제 난이도: 실버 1 사용 알고리즘: DFSimport Foundationlet n = Int(readLine()!)!var map: [[Int]] = []var heights = Set()var sortedHeights = [Int]()let directions = [(0, -1), (0, 1), (-1, 0), (1, 0)]var visited = Array(repeating: Array(repeating: false, count: n), count: n)var mapCount = 0var result = 0for _ in 0 ..= n || y = n || map[y][x] i { dfs(x: x, y: y, height: i) mapCoun..