Python 백준 알고리즘 9252 : LCS 2

https://www.acmicpc.net/problem/9252

9252번: LCS 2

 

# 9252 LCS 2

a = input()
b = input()

dp = [[""]*(len(b)+1) for _ in range(len(a)+1)]

for i in range(1, len(a)+1):
  for j in range(1, len(b)+1):
    if a[i-1] == b[j-1]:
      dp[i][j] = dp[i-1][j-1]+a[i-1]
    else:
      if len(dp[i][j-1]) < len(dp[i-1][j]):
        dp[i][j] = dp[i-1][j]
      else:
        dp[i][j] = dp[i][j-1]

result = dp[len(a)][len(b)]
print(len(result))
if len(result):
  print(result)