def solve_multiple_knapsack_optimized(n, m, items): # 二进制优化后的物品列表 binary_items = [] # 将物品按二进制拆分 for w, v, s in items: k = 1 while s > 0: amount = min(k, s) binary_items.append((w * amount, v * amount)) s -= amount ...