@Alan3 #9 [img]https://i.imgur.com/5oFSUfk.png[/img]

@Alan3 #8 上一条好像格式乱了： https://imgur.com/a/ZGJgmaz

def max_books(books):
n = len(books)
max_books = max(books)
# dp[i][j] = max books we can take if we take j books from shelf i
dp = [[0]*(max_books+1) for _ in range(n+1)]
for i in range(1, n+1):
for j in range(1, max_books+1):
if j > books[i-1]: continue
for k in range(j):
dp[i][j] = max(dp[i][j], dp[i-1][k] + j)
return max(max(row) for row in dp)

books = [8,5,2,7,9]
# books = [7,0,3,4,5]
# books = [8,2,3,7,3,4,0,1,4,3]
print(max_books(books)) # Output: 19


不知道解法正确不，但是我测试这几个例子输出一致，切特急皮特 给的答案

Trojan ，xray 啥乱七八糟协议也是封我端口，唯有 naive 稳如老狗

[Imgur]( https://imgur.com/Tdeb9xv) 是我没更新吗？ 要手动导入