RE: Algorithms Series: 0/1 BackPack ACM题解 - 经典0/1背包问题 by objc0

programming · @objc0 · Apr 25 '18

赞，只要着重讲解动态规划方程就行，程序实现写多了感觉帮助不大，看着方程自己实现就好了。

`author`	objc0
`permlink`	re-justyy-algorithms-series-0-1-backpack-acm-0-1-20180425t082614129z
`category`	programming
`json_metadata`	{"tags":["programming"],"app":"steemit/0.1"}
`created`	2018-04-25 08:26:15
`last_update`	2018-04-25 08:26:15
`depth`	1
`children`	0
`last_payout`	2018-05-02 08:26:15
`cashout_time`	1969-12-31 23:59:59
`total_payout_value`	0.000 HBD
`curator_payout_value`	0.000 HBD
`pending_payout_value`	0.000 HBD
`promoted`	0.000 HBD
`body_length`	43
`author_reputation`	3,456,457,068
`root_title`	"Algorithms Series: 0/1 BackPack ACM题解 - 经典0/1背包问题"
`beneficiaries`	`[]`
`max_accepted_payout`	1,000,000.000 HBD
`percent_hbd`	10,000
`post_id`	52,022,034
`net_rshares`	0