# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1147716 | maomao | Mountains (NOI20_mountains) | Pypy 3 | 2098 ms | 77128 KiB |
#https://oj.uz/problem/view/NOI20_mountains
n = int(input())
height = [int(x) for x in input().split()]
ans = 0
while True:
if len(height) < 3:
break
else:
left = []
right = []
m = max(height)
m_index = height.index(m)
left.append(height[i] for i in range(0,m_index))
right.append(height[i] for i in range(m_index+1,len(height)))
ans+=len(left)*len(right)
height.remove(m)
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... |