最接近点对问题，分治法实现，随机生成N个数寻找最短路径的两个点-closest point of the problem, realizing the partition method, random number generation N to find the shortest path to the two points
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001226s ]
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.098178s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001260s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001888s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001117s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003585s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000956s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003141s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016488s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001497s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 320988 [ RunTime:0.001234s ]
