测试点1 Accepted / 1ms / 336kB

测试点2 Accepted / 0ms / 336kB

测试点3 Accepted / 0ms / 336kB

测试点4 Accepted / 1ms / 336kB

测试点5 Accepted / 15ms / 336kB

测试点6 Accepted / 49ms / 336kB

测试点7 Accepted / 105ms / 336kB

测试点8 Accepted / 443ms / 336kB

测试点9 Accepted / 768ms / 336kB

测试点10 Unaccepted / 选手程序运行超过时限

var i,n,f:longint;

a:array[1..20000]of longint;

procedure ni(n,m:longint);

var i,j,x:longint;

begin

x:=(n+m)div 2;

f:=0;

for i:=1 to x do

for j:=i+1 to x do

if a[i]>a[j] then inc(f);

for i:=x+1 to m do

for j:=i+1 to m do

if a[i]>a[j] then inc(f);

for i:=1 to x do

for j:=x+1 to m do

if a[i]>a[j] then inc(f);

end;

begin

read(n);

for i:=1 to n do

read(a[i]);

ni(1,n);

write(f);

end.