编程实现最大子段和问题的求解（分别采用分治法和动态规划法求解）。-Programming the largest sub-segment and the problem solving (respectively divide and conquer and dynamic programming method to solve).
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001229s ]
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.061668s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001140s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001171s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000956s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003842s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000972s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004499s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.017976s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001248s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 262718 [ RunTime:0.012179s ]
