动态规划 | 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
华为笔试刷题 文章被收录于专栏
高质量题: 1~40:HJ16,HJ22,HJ24,HJ26,HJ27,HJ28,HJ35,HJ37,HJ39; 40~80:HJ41,HJ42,HJ43,HJ44,HJ48,HJ50,HJ52,HJ53,HJ57,HJ61,HJ63,HJ64,HJ70,HJ71,HJ74,HJ77; 80~108:HJ82,HJ85,HJ88,HJ89,HJ93,HJ95,HJ98,HJ103,HJ107