你那个过了的是分组背包
by yukimianyan @ 2023-08-23 18:33:10
你枚举i:C->0，尝试更新f[i]的时候分组背包，枚举体积，选一个最优的转移更新，体积枚举顺序不重要，外面的i从大到小保证01背包
by yukimianyan @ 2023-08-23 18:36:17
@[xiao__xiao](/user/1015805)
by yukimianyan @ 2023-08-23 18:41:39
@[yukimianyan](/user/509229) ! 懂了，谢谢
by xiao__xiao @ 2023-08-23 19:16:42