@[HEIMOFA](/user/929819) 类似于01背包,倒序进行:
```
if(j-a[i]>=0&&f[j-a[i]][k])f[j][k]=1;
if(k-a[i]>=0&&f[j][k-a[i]])f[j][k]=1;
```
等价于
```
if(j-a[i]>=0)f[j][k]=max(f[j][k],f[j-a[i]][k]);
if(k-a[i]>=0)f[j][k]=max(f[j][k],f[j][k-a[i]]);
```
个人感觉
by mayike @ 2023-09-02 21:53:08
@[mayike](/user/1039406) 草,现在已经理解了,不过还是很感谢
by HEIMOFA @ 2023-09-03 09:59:07