Skip to content

《背包问题九讲》2.0 alpha1

四年前,我曾经有过一个写一系列DP相关文章的宏伟计划,但当时这个计划仅完成了第一部《背包问题九讲》就因为我感到个人能力不足的原因中止了。

现在,我打算将这个暂命名为“动态规划的思考艺术”的文章系列重新启动。其第一步便是用LaTeX重新修订那部广为传播并被做成过各种格式各种版本的“背包九讲”。

现在我已经完成了用LyX将九讲的原始文本输入并略加修饰的第一步,于是发布一个 alpha1 版本。下载地址在: http://love-oriented.com/pack/pack2alpha1.pdf

欢迎阅读并帮忙指正错漏之处,捉到的bugs较多或较大的同学有机会提前预览本系列将来的文章。

12 Comments

  1. jzlikewei wrote:

    已下载拜读中

    Thursday, September 15, 2011 at 21:11 | Permalink
  2. xiaodao wrote:

    热泪盈眶..Orz )

    Friday, September 16, 2011 at 09:11 | Permalink
  3. oa414 wrote:

    终于开始重新启动了……我以为DD已经忘掉这个了。

    最近博客更新异常频繁啊

    Friday, September 16, 2011 at 22:31 | Permalink
  4. chegde wrote:

    拿走学习..

    Sunday, September 18, 2011 at 12:16 | Permalink
  5. comzyh wrote:

    恩,才看到您的帖子,我会将我制作的Tex文件发给你

    Wednesday, September 21, 2011 at 01:03 | Permalink
  6. jhang wrote:

    有个问题请教下,为什么完全背包问题未优化前的时间复杂度为O(NVΣ(V/c[i]))

    Friday, June 1, 2012 at 09:35 | Permalink
  7. Rhea Vinson wrote:

    由于这个雄心勃勃的写作计划耗时很多,所以打算采取分模块发布的方式。近几日就会发布的将是《背包问题经典十题》(暂定名),然后会有《线性动态规划的思想方法》《矩形中的基本动态规划》《解关于资源分配的动态规划问题》等一篇篇相对独立文章的面世,每篇不超过二万字。最后,通过对题目的总结,得出一个可行性很强的解动态规划题的基本思想方法,并与以上各篇文章组成一个整体,全文大约十万字。

    Tuesday, July 16, 2013 at 11:10 | Permalink
  8. video wrote:

    I am really loving the theme/design of your website. Do you ever run into any web browser compatibility issues?
    A handful of my blog readers have complained about my blog not working correctly in Explorer but looks great in Safari.
    Do you have any ideas to help fix this problem?

    Tuesday, September 9, 2014 at 14:54 | Permalink
  9. Hi to every single one, it’s in fact a pleasant for me to pay a quick
    visit this web site, it contains valuable Information.

    Wednesday, September 10, 2014 at 15:46 | Permalink
  10. Howdy! I know this is somewhat off topic but I was wondering if you knew
    where I could locate a captcha plugin for my comment form?
    I’m using the same blog platform as yours and I’m having difficulty finding one?
    Thanks a lot!

    Sunday, September 14, 2014 at 02:58 | Permalink
  11. This design is steller! You most certainly know how to
    keep a reader entertained. Between your wit and your videos, I was almost moved to start my own blog (well, almost…HaHa!) Fantastic job.

    I really enjoyed what you had to say, and more than that, how
    you presented it. Too cool!

    Saturday, September 27, 2014 at 00:05 | Permalink
  12. CHEATBEATER wrote:

    开始学习Orz

    Friday, October 31, 2014 at 00:17 | Permalink

3 Trackbacks/Pingbacks

  1. [...] Gold miner 分组背包,详见《背包问题九讲》。 用点积判断是否在一条直线上。 #include <iostream> #include <cstdio> [...]

  2. POJ 2063 Investment 解题报告 | 云岚流之家 on Friday, January 2, 2015 at 11:13

    […] 当然,这道题也可以用背包问题的思想来解决,即用g(c)=max( g(c), g(c-bond[i].cost)+bond[i].interest ). 然后再一个i从1到d的大循环。提到背包问题,突然发现有个叫“背包九讲”(http://cuitianyi.com/blog/%E3%80%8A%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E4%B9%9D%E8%AE%B2%E3%80%8B2-&#8230;),有空得拜读一下。 […]

  3. […] 崔添翼 § 翼若垂天之云 › 《背包问题九讲》2.0 alpha1 […]

Post a Comment

Your email is never published nor shared. Required fields are marked *
*
*