timleee

摘要： def f(i,j): while i>=0: if i==0 and j>=l[i][0]: return l[i][1] elif i==0 and j<l[i][0]: return 0 else: return max(f(i-1,j-l[i][0])+l[i][1],f(i-1,j))i 阅读全文