奥运场馆的规划问题。各场馆位置分散，根据Prim算法求最小生成树，这是算法主体-Planning of the Olympic venues. Various venues in scattered locations, according to Prim minimum spanning tree algorithm is seeking, which is the main algorithm
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001526s ]
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.086100s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001172s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001930s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001163s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003654s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000962s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003230s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015504s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001523s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 69390 [ RunTime:0.001313s ]
