Merge pull request #732 from gmlrude/main

[박희경] 117차 라이브 코테 제출

Author: github-actions[bot]

live11/test117/문제1/박희경.py

@@ -0,0 +1,18 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+towers = list(map(int, input().split()))
+
+stack = []  # 탑 번호
+res = [0] * n
+
+for i in range(n):
+    while stack and towers[stack[-1]] < towers[i]:  # 왼쪽 탑이 더 낮으면
+        stack.pop()
+    if stack:
+        res[i] = stack[-1] + 1
+    stack.append(i)
+print(*res)
+

live11/test117/문제2/박희경.py

@@ -0,0 +1,34 @@
+"""
+dp[현재노드] = min(dp[자식노드][얼리어답터인 경우;1], dp[자식노드][아닌 경우;0])
+"""
+
+import sys
+from collections import *
+sys.setrecursionlimit(10**6)
+
+input = sys.stdin.readline
+
+graph = defaultdict(list)
+n = int(input())
+for _ in range(n-1):
+    u, v = map(int, input().split())
+    graph[u].append(v)
+    graph[v].append(u)
+
+dp = [[0, 0] for _ in range(n + 1)]     # [노드번호][얼리어답터 체크]
+visited = [0 for _ in range(n + 1)]
+def dfs(start):
+    visited[start] = 1
+    if len(graph[start]) == 0:
+        dp[start][1] = 1
+        dp[start][0] = 0
+    else:
+        for i in graph[start]:
+            if not visited[i]:
+                dfs(i)
+                dp[start][1] += min(dp[i][0], dp[i][1])
+                dp[start][0] += dp[i][1]
+        dp[start][1] += 1
+
+dfs(1)
+print(min(dp[1][0], dp[1][1]))