动态规划 | HJ103 Redraiment的走法

while True:
    try:
        n = int(input())
        stumps = list(map(int, input().split()))
        record = [1 for _ in range(n)]
        for i in reversed(range(n)):
            for j in range(i+1, n):
                if stumps[i] < stumps[j]:
                    record[i] = max(record[i], record[j]+1)
        # print(record)
        print(max(record))
    except:
        break

用时：1h