这是关于01背包问题的动态规划算法。采用C++语言完成的，代码间有注释。-This is about 01 knapsack problem dynamic programming algorithm. Using C++ language completed, there are comments between the code.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001484s ]
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.078309s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001289s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001160s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000829s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003054s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000797s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003679s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.013153s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001354s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 62064 [ RunTime:0.018421s ]
