Python题解 | #Redraiment的走法#

import sys




while True:
    try:
        n = int(input())
        arr = list(map(int, input().strip().split(' ')))
        res = []
        cur = []
        dp = [1] * n
        flag = 0
        for i in range(1, len(arr)):
            for j in range(0, i):
                if arr[j] < arr[i]:
                    dp[i] = max(dp[i], dp[j] + 1)

        print(max(dp))


    except:
        break