详细讲解了动态规划的算法问题，再通过“装箱问题”等7个程序实例介绍解决动态规划问题的思路和方法。-Gave a detailed algorithm for dynamic programming problems, and through the " bin-packing problem" and other instances of seven procedures introduced to solve the problem of dynamic programming ideas and methods.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001303s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.153523s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001288s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002040s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001291s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003741s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001113s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003439s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015949s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001438s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 174826 [ RunTime:0.001479s ]
