每次老师叫我们去讲题目的时候，初一的人总会高呼郭同学的名字。我一直不知道他们为什么干这个，也许郭同学特别好吧。但是今天，我在学军OJ讨论区上看到了这么一段话： 标题：神人！ 1楼：yujialuo2011 「guoyuqi11」（蓝天注：郭同学）3分钟十一道题，平均十六秒一题，神人那！大家向他多多请教！如何才能练出如此神功！ 2012-07-18 16:27:11 2楼：Wuao11比卡门还神 2012-07-18 16:28:48 3楼：cyf2 36119 zhaoyq2011 P1341 Accepted 2012-07-18 16:07:16 36118 guoyuqi11 P1547 Accepted 2012-07-18 15:55:56 36117 guoyuqi11 P1336 Accepted 2012-07-18 15:55:37 36116 guoyuqi11 P1317 Accepted 2012-07-18 15:55:26 36115 guoyuqi11 P1320 Accepted 2012-07-18 15:55:10 36114 guoyuqi11 P1308 Accepted 2012-07-18 15:54:43 36113 guoyuqi11 P1014 Accepted 2012-07-18 15:54:18 36112 guoyuqi11 P1357 Accepted 2012-07-18 15:53:...
各种OIer的快排（Pascal语言）
OIer 1： procedure qsort (l,r: longint ); var i,j,m,t: longint ; begin i:=l; j:=r; m:=a[(l+r) div 2 ]; repeat while a[i]m do dec(j); if ij; if l <j then qsort(l,j); if i <r then qsort(i,r); end ; OIer 2： Procedure QuickSort (Left, Right : Longint ); Var LeftPointer, RightPointer, Medium, Temp : Longint ; Begin LeftPointer := Left; RightPointer := Right; Medium := a[(Left + Right) Shr 1 ]; Repeat While a[LeftPointer] Medium Do Dec(RightPointer); If LeftPointer j; If Left < RightPointer Then QuickSort(Left,RightPointer); If LeftPointer < Right Then QuickSort(LeftPointer,Right); End ; {End Procedure} OIer 3： procedure kuaipai (z,y: longint ); var i,j,m,t: longint ; begin i:=z;j:=y;m:=a[(z+y) div 2 ]; repeat while a[i]m do dec(j); if ij; if z <j then kuaipai(z,j)...