0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001417s ]
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.091903s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001195s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001881s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001207s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003554s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001024s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003192s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014969s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001409s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 151151 [ RunTime:0.001415s ]
