# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1149431 | maomao | Mountains (NOI20_mountains) | Pypy 3 | 2098 ms | 97144 KiB |
n = int(input())
height = [int(x) for x in input().split()]
h_sort = sorted(height)
ans = 0
for i in range(n):
height[i]=h_sort.index(height[i])
for i in range(n):
left = right = 0
u = height[i]
for j in range(0,i):
if height[j]<u:
left +=1
for j in range(i+1,n):
if height[j]<u:
right+=1
ans += left*right
print(ans)
Compilation message (stdout)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |