考虑整数线性规划问题max（ci*xi）试设计一个解此问题的动态规划算法，并分析算法的计算复杂性-Consider the integer linear programming problem max (ci* xi) try to design a solution of this problem, dynamic programming algorithm, and analysis of algorithms computational complexity
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002414s ]
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.104118s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.003109s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002161s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002853s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003727s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.003214s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003426s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015161s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.003192s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 163893 [ RunTime:0.001385s ]
