황소개발자

많이 풀면 보입니다 n = int(input()) lst = list(map(int, input().split())) a = [1 for i in range(n)] b = [1 for i in range(n)] for i in range(n): for j in range(i): if lst[i] > lst[j]: a[i] = max(a[i], a[j] + 1) lst.reverse() for i in range(n): for j in range(i): if lst[i] > lst[j]: b[i] = max(b[i], b[j] + 1) b.reverse() c = [0 for i in range(n)] for i in range(n): c[i] = a[i] + b[i] print(max(c) - 1)

n = int(input()) lst = list(map(int, input().split())) dp_left = [1] * n dp_right = [1] * n for i in range(n): for j in range(i): if lst[j] < lst[i]: if dp_left[i] < dp_left[j] + 1: dp_left[i] = dp_left[j] + 1 for i in range(n - 1, -1, -1): for j in range(n - 1, i, -1): if lst[j] < lst[i]: if dp_right[i] < dp_right[j] + 1: dp_right[i] = dp_right[j] + 1 dp = [dp_left[i] + dp_right[i] for i in ran..