@[Tom90325](/user/464170)
01背包+暴力去$\min_{a\to b}\{f[i]\}$
by Custlo0793 @ 2021-06-20 22:58:11
$f[k]=\underset{i\leq n}\min\{{f[k-a[i]]+1}\}$
by Custlo0793 @ 2021-06-20 23:04:06
这为什么是 $dp$ 啊?
先判一下是否无解,然后对物品从大到小排序,贪心取最大的,达到 $a$ 时取的数量即为答案。
by C C A @ 2021-06-21 08:25:37
@[C C A](/user/78645) A=B=99,a1=100,a2=a3=...=a99=1
by WYXkk @ 2021-06-21 08:54:31
@[WYXkk](/user/130151) 啊这...我是 sb QAQ
by C C A @ 2021-06-21 08:57:07
话说有比 $0/1$ 背包复杂度更优的做法吗?
by C C A @ 2021-06-21 09:01:12
@[Azusaasanoier](/user/307535) 每个物体只有一个吧
by WYXkk @ 2021-06-21 09:06:27
@[Tom90325](/user/464170) 数据范围?
by Mobius127 @ 2021-06-21 09:09:44
@[WYXkk](/user/130151) qs,我方程表达不太对
by Custlo0793 @ 2021-06-21 09:48:04
@[127_127_127](/user/341102) $n$<=$1000$
by Ctjer @ 2021-06-21 12:03:09