- 合并果子
- 2010-03-05 18:47:42 @
var a:array[1..100000] of longint;
i,j,n,k,stmp:longint;sum,he:int64;
procedure qsort(x,y:longint);
var i,j,m,k:longint;
begin
i:=x;j:=y;m:=a[(x+y) div 2];
repeat
while a[i]m do dec(j);
if ij;
if x
0 条评论
目前还没有评论...