- 火烧赤壁
- @ 2009-09-05 09:28:28
大牛,小牛,中牛
帮忙看看
咋错了
才30分`\``
var n,i,j,s:longint;
a,b:Array [1..100000] of longint;
procedure kp(l,r:longint);
var i,j,mid,w:longint;
begin
i:=l;j:=r;mid:=b[(i+j) div 2];
repeat
while b[i]
4 条评论
-
awe LV 8 @ 2009-09-05 10:18:10
做对了就好了么
草你吗B草你吗Bxhx
-
@ 2009-09-05 10:07:11
做对了
麻烦大家了
var n,i,j,s:longint;
a,b:Array [1..100000] of longint;
procedure kp(l,r:longint);
var i,j,mid,w:longint;
begin
i:=l;j:=r;mid:=a[(i+j) div 2];
repeat
while a[i] -
@ 2009-09-05 09:58:56
LZ的算法真高深啊
都已经快排完了,为何还要N^2的啊 -
@ 2009-09-05 09:50:48
草
不会做就别做!!!!!!!
- 1