[오늘의 알고리즘] 탑 (#42)

Author: yongjun-0903

yongjun-0903/탑.py

@@ -0,0 +1,41 @@
+"""
+처음 생각
+import sys
+N = int(sys.stdin.readline().strip())
+tops = list(map(int, sys.stdin.readline().split()))
+tops = list(reversed(tops))
+answer = []
+# i는 0부터 3까지
+for i in range(N - 1):
+    # j는 1부터 4까지
+    for j in range(i+1, N):
+        if tops[i] > max(tops[j:]):
+            answer.append(N)
+        elif tops[i] <= tops[j]:
+            answer.append(tops[j])
+answer.append(N)
+reversed_tops = [N - x for x in answer]
+print(list(reversed(reversed_tops)))
+"""
+
+import sys
+
+N = int(sys.stdin.readline().strip())
+heights = list(map(int, sys.stdin.readline().split()))
+
+result = [0] * N
+
+stack = []
+
+for i in range(N):
+    height = heights[i]
+    
+    while stack and heights[stack[-1]] < height:
+        stack.pop()
+        
+    if stack:
+        result[i] = stack[-1] + 1
+    
+    stack.append(i)
+    
+print(' '.join(map(str, result)))