求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001468s ]
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.098958s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001377s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001946s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001373s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003690s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001160s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003276s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014826s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001537s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 126318 [ RunTime:0.001693s ]
