Loading docs/dp/backpack.md +1 −1 Original line number Diff line number Diff line Loading @@ -49,7 +49,7 @@ for (int i=1;i<=v1;i++) [例题代码](https://www.luogu.org/paste/2mb5d46q) Ps.事实上,由到大穷举是另一种背包问题的解法,稍后会提到 Ps.事实上,由小到大穷举是另一种背包问题的解法,稍后会提到 #### 完全背包 Loading Loading
docs/dp/backpack.md +1 −1 Original line number Diff line number Diff line Loading @@ -49,7 +49,7 @@ for (int i=1;i<=v1;i++) [例题代码](https://www.luogu.org/paste/2mb5d46q) Ps.事实上,由到大穷举是另一种背包问题的解法,稍后会提到 Ps.事实上,由小到大穷举是另一种背包问题的解法,稍后会提到 #### 完全背包 Loading