Submission #19905237

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
N,*A = $<.read.split.map(&:to_i)
I = [nil]*N
A.each_with_index{|a,i|
  I[a] = i
}
S = [0]*(N+1)
def S.sum i
  s = S[i+=1]
  s += S[i] while 0 < i&=i-1
  return s
end
def S.inc i
  S[i+=1] += 1
  S[i] += 1 while S[i+=i&-i]
end
*V = I.sum{|i|
  S.inc i
  (i+1-S.sum(i)).abs
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N,*A = $<.read.split.map(&:to_i)

I = [nil]*N
A.each_with_index{|a,i|
	I[a] = i
}

S = [0]*(N+1)
def S.sum i
	s = S[i+=1]
	s += S[i] while 0 < i&=i-1
	return s
end
def S.inc i
	S[i+=1] += 1
	S[i] += 1 while S[i+=i&-i]
end

*V = I.sum{|i|
	S.inc i
	(i+1-S.sum(i)).abs
}
A.each{|a|
	V << V[-1]+N-1-a-a
}
V.pop
puts V

Submission Info

Judge Result