摘要:
https://vjudge.net/contest/297216?tdsourcetag=s_pctim_aiomsg#problem/L 阅读全文
摘要:
https://vjudge.net/contest/297216?tdsourcetag=s_pctim_aiomsg#problem/K 3(物品组数) 3(时间) f[i,j]表示完成了前i件任务,背包容量为j时所能达到的最大价值。f[i-1,j-cost]+val;2 1 最多选一件 2 5 阅读全文