用c++写一个售货员问题。这是高级算法中除了红黑树中最难的一个了。是研究生课程中的的程序实现-used to write a salesman problem. This is in addition to the High algorithm RED-BLACK TREE which one of the most difficult. The postgraduate courses in the program
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001319s ]
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.094937s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001250s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001955s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001278s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003589s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001050s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003251s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015107s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001565s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 61430 [ RunTime:0.001528s ]
