Merge pull request #530 from jihye1006/main

[최지혜] 65차 라이브코테 제출

Author: github-actions[bot]

live6/test65/문제1/최지혜.py

@@ -0,0 +1,30 @@
+def count(lst):
+    cnt = ans = 1
+    for i in range(1, len(lst)):
+        if lst[i]==lst[i-1]:
+            cnt+=1
+            ans = max(ans, cnt)
+        else:
+            cnt=1
+    return ans
+
+def solve(arr):
+    mx = 0
+    for i in range(N-1):
+        for j in range(0,N):
+            # 오른쪽 사탕과 교환
+            arr[i][j],arr[i][j+1]=arr[i][j+1],arr[i][j]
+            mx = max(mx, count(arr[i]))
+            arr[i][j],arr[i][j+1]=arr[i][j+1],arr[i][j]
+
+            # 아래쪽 사탕과 교환
+            arr[i][j],arr[i+1][j]=arr[i+1][j],arr[i][j]
+            mx = max(mx, count(arr[i]),count(arr[i+1]))
+            arr[i][j],arr[i+1][j]=arr[i+1][j],arr[i][j]
+    return mx
+
+N = int(input())
+arr = [list(input())+[0] for _ in range(N)]+[[0]*(N+1)]
+arr_t = list(map(list, zip(*arr)))
+ans = max(solve(arr), solve(arr_t))
+print(ans)

live6/test65/문제2/최지혜.py

@@ -0,0 +1,16 @@
+import sys
+n = int(sys.stdin.readline())
+board = [[] for _ in range(n)]
+
+for i in range(n):
+  board[i] = list(map(int,sys.stdin.readline().split()))
+
+# DP 사용
+dp = [0 for i in range(n+1)]
+for i in range(n-1,-1,-1):
+  if i + board[i][0] > n:
+      dp[i] = dp[i+1]
+  else:
+      dp[i] = max(board[i][1] + dp[i + board[i][0]], dp[i+1])
+  
+print(dp[0])

live6/test65/문제3/최지혜.py

@@ -0,0 +1,8 @@
+def solution(s): 
+    stack = []
+    for i in s:
+        if len(stack) == 0: stack.append(i)
+        elif stack[-1] == i: stack.pop()
+        else: stack.append(i)
+    if len(stack) == 0: return 1
+    else: return 0