这是一个求网络最小费用最大流问题的一个C++的程序已经经过调试,请放心使用.-This is a minimum cost network for the largest flow of a C procedures after debugging, please rest assured that use.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001278s ]
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.089421s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001201s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001872s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001206s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003543s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001047s ]
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.015162s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001367s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 64520 [ RunTime:0.001480s ]
