一个0-1背包问题的C++实现，背包的容量为t，各物品的重量分别为w1，w2。。。wn，找一个能装下最大重量的物品组合，用递归形式的贪心法实现-a 0-1 knapsack problem of C achieved, the capacity for backpack t, the weight of the items were w1, w2. . . Wn, one can find the largest installed under the weight of goods portfolio, using recursive form greedy Method
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002480s ]
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.087887s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002112s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001859s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002219s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003512s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.003000s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003244s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014416s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002484s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 91775 [ RunTime:0.001485s ]
