在m×n的矩阵中有一个元素a[i,j]满足下述条件：a[i,j]既是第i行元素中的最小值，又是第j列元素中的最大值（称为鞍点），此程序是求矩阵鞍点的算法-In the m × n matrix has an element of a [i, j] satisfy the following conditions: a [i, j] is not only the first i elements of the minimum trip, but also is the first j elements out of the maximum value (called saddle point), this procedure is the saddle point matrix algorithm
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.008262s ]
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.184603s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.018664s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001146s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000998s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003350s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000865s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003592s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.025448s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001515s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 108934 [ RunTime:0.016544s ]
