# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1147723 | maomao | Mountains (NOI20_mountains) | Pypy 3 | 2095 ms | 304292 KiB |
#https://oj.uz/problem/view/NOI20_mountains
n = int(input())
height = [int(x) for x in input().split()]
h_sort = sorted(height,reverse = True)
ans = 0
for k in range(n-2):
left = []
right = []
m = height.index(h_sort[k])
for i in range(0,m):
if height[i] < height[m]:
left.append(height[i])
for i in range(m+1,len(height)):
if height[i] < height[m]:
right.append(height[i])
ans += len(left)*len(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... |