该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001487s ]
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.107102s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000962s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001092s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001006s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003199s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000778s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003602s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015213s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001096s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 117102 [ RunTime:0.021716s ]
