pascal为何RE

P1090 [NOIP2004 提高组] 合并果子 / [USACO06NOV] Fence Repair G

数据大过头了。。。
by 丁一 @ 2017-01-31 10:47:19


说明评测数据超乎你现象的大。。
by TvTw @ 2017-02-02 17:07:18


···pas ```cpp var a:array[1..10001] of longint; n,i,j,k,m:longint; s:int64; procedure qsort(l,r:longint); var t,mid:longint; begin i:=l; j:=r; mid:=(l+r) div 2; repeat while a[i]<mid do inc(i); while a[j]>mid do dec(j); if i<=j then begin t:=a[i]; a[i]:=a[j]; a[j]:=t; inc(i); dec(j); end; until i>j; if l<j then qsort(l,j); if i<r then qsort(i,r); end; procedure move; begin for i:=1 to n-2 do a[i]:=a[i]+2; a[n]:=0; a[n-1]:=0; end; procedure ins; var t:longint; begin for t:=n downto m+1 do a[t+1]:=a[t]; a[m]:=k; inc(n); end; begin readln(n); for i:=1 to n do read(a[i]); qsort(1,n); while n>=1 do begin s:=s+a[1]+a[2]; k:=a[1]+a[2]; move; dec(n,2); while k>=a[i] do inc(m); ins; end; writeln(s); end. ``` ··· 9tle1re
by Hydroxyl @ 2017-02-05 20:27:14


|