Skip to content
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.

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

1.5一个常数优化 #5

Open
Autoria opened this issue Jan 24, 2017 · 10 comments
Open

1.5一个常数优化 #5

Autoria opened this issue Jan 24, 2017 · 10 comments

Comments

@Autoria
Copy link

Autoria commented Jan 24, 2017

对内层V的优化应该是max(V-sigma(C_i), C_i) 而不是max(V-sigma(W_i), C_i)吧,
因为V是背包的容量,C_i是第i件物品消耗的容量

@Dev-XYS
Copy link

Dev-XYS commented Jan 24, 2017

  是的,我也认为有这个问题。

@liuyunbin
Copy link

我觉得也应该是这个 bound=max{V-sum{c[i..n]},c[i]}

@shimachao
Copy link

我也认为作者笔误了。怎么还没改过来

@xiangsxuan
Copy link

tim 20180725172311

@Azuer
Copy link

Azuer commented Jul 27, 2018

我在看的时候也发现了,可以确定是作者的笔误,之前看的是word版本,准备过来提issue,没想到被眼尖的你提过了

@fliaj
Copy link

fliaj commented Aug 13, 2019

今天发现了问题..v2还是没有更正

@xxwywzy
Copy link

xxwywzy commented Jul 31, 2020

而且我认为下标应该从 i+1 开始,参考 https://www.jianshu.com/p/8d41d87fcbb7

@RickHuang2001
Copy link

而且我认为下标应该从 i+1 开始,参考 https://www.jianshu.com/p/8d41d87fcbb7

从 i+1 开始当然更好,但是从0开始也不会出错。

@RickHuang2001
Copy link

今天发现了问题..v2还是没有更正

v2已经是9年前的了,作者已经7年没有commit了,更正可能性微存。

@piecezzz
Copy link

这里想了半天,感觉确实是笔误

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

10 participants