这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001398s ]
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.092969s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001257s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001945s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001262s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003603s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001153s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003178s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014726s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001320s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 62874 [ RunTime:0.001319s ]
