[boj] 옥상 정원 꾸미기 [G5]

Author: hyeonbinHur

허현빈/4주차/260123-1.js

@@ -0,0 +1,29 @@
+const input = require("fs")
+  .readFileSync("./dev/stdin.txt")
+  .toString()
+  .trim()
+  .split("\n")
+  .map((e) => +e);
+
+const ans = () => {
+  const n = input.shift();
+  const arr = input;
+  let result = 0;
+  const stack = []; // 높이만 저장
+
+  for (let i = arr.length - 1; i >= 0; i--) {
+    const height = arr[i];
+
+    // 현재 높이보다 낮은 건물들을 모두 제거
+    while (stack.length && stack[stack.length - 1] < height) {
+      stack.pop();
+    }
+
+    // 스택에 남은 건물 수 = 현재 건물이 볼 수 있는 건물 수
+    result += stack.length;
+    stack.push(height);
+  }
+
+  console.log(result);
+};
+ans();

허현빈/4주차/260123-2.js

@@ -0,0 +1,49 @@
+const input = require("fs")
+  .readFileSync("./dev/stdin.txt")
+  .toString()
+  .trim()
+  .split("\n")
+  .map((e) => e.split(" "))
+  .map((e) => e.map((e2) => Number(e2)));
+
+input.pop();
+
+const ans = () => {
+  const ans = [];
+  const arr = input;
+  for (let i = 0; i < arr.length; i++) {
+    arr[i].shift();
+    ans.push(findAns(arr[i]));
+  }
+
+  function findAns(arr) {
+    const lStack = [];
+    const lAns = [];
+    const rStack = [];
+    const rAns = [];
+    const tempAns = [];
+
+    for (let i = 0; i < arr.length; i++) {
+      const arrVal = arr[i];
+      let count = 0;
+      if (lStack.length) {
+        const val = lStack[lStack.length - 1];
+        if (val >= arrVal) {
+          lStack.pop();
+          count += arrVal;
+        }
+        lStack.push(arrVal);
+      }
+      lAns.push(arrVal);
+    }
+
+    console.log(lAns);
+    for (let i = arr.length - 1; i >= 0; i--) {}
+    for (let i = 0; i < arr.length; i++) {
+      tempAns[i] + arr[i];
+    }
+
+    return Math.max(...tempAns);
+  }
+};
+ans();