这个程序是用C++来实现的最优三角剖分问题。用的是动态规划算法来实现的。-This procedure is used to achieve the C optimal triangulation problem. Using a dynamic programming algorithm to achieve.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001326s ]
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.090723s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001157s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001869s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001143s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003756s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001039s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003229s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015182s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001356s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 62350 [ RunTime:0.001155s ]
