Skip to content

c[] 与 w[] 的混淆误用修改 #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
zornlemma wants to merge 1 commit into
base: master
Choose a base branch
from
Open

c[] 与 w[] 的混淆误用修改 #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions V1/P01.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -97,7 +97,7 @@ <h2>一个常数优化</h2>

<p class="first">前面的伪代码中有 for v=V..1，可以将这个循环的下限进行改进。</p>

<p>由于只需要最后f[v]的值，倒推前一个物品，其实只要知道f[v-w[n]]即可。以此类推，对以第j个背包，其实只需要知道到f[v-sum{w[j..n]}]即可，即代码中的</p>
<p>由于只需要最后f[v]的值，倒推前一个物品，其实只要知道f[v-c[n]]即可。以此类推，对以第j个背包，其实只需要知道到f[v-sum{c[j..n]}]即可，即代码中的</p>

<pre class="example">
for i=1..N
Expand All @@ -108,7 +108,7 @@ <h2>一个常数优化</h2>

<pre class="example">
for i=1..n
bound=max{V-sum{w[i..n]},c[i]}
bound=max{V-sum{c[i..n]},c[i]}
for v=V..bound
</pre>

Expand Down