贪心算法解决分割问题
给定一定的宽度，和N个输入（宽度）
得出最小的宽度-greedy algorithm to solve the segmentation problem must set the width and N input (width) reached the minimum width
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002134s ]
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.087877s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002366s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001937s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002117s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003628s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002053s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003188s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014599s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002371s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 236948 [ RunTime:0.001225s ]
