利用动态规划技术和递推的办法，求出两个字母表A和B的最大公共字串长度。-The use of dynamic programming techniques and recursive approach to find the two alphabets A and B, the largest public string length.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001442s ]
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.093236s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001349s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001910s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001244s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003682s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001123s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003235s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014860s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001408s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 166392 [ RunTime:0.001376s ]
