自己编写的，背包问题的各种近似算法以及动态规划算法，请多多指教-I have written, knapsack problem, as well as a variety of approximate dynamic programming algorithm algorithm, please advice
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001060s ]
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.065481s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001163s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001189s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000990s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003389s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000918s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003915s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015864s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001158s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 214524 [ RunTime:0.013782s ]
