Submission #1147722

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147722		maomao	Mountains (NOI20_mountains)	Pypy 3	64 / 100	2104 ms	307816 KiB

Mountains

#https://oj.uz/problem/view/NOI20_mountains
n = int(input())
height = [int(x) for x in input().split()]
ans = 0

while len(height)>=3:
  left = []
  right = []
  m = height.index(max(height))
  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)
  height.pop(m)
print(ans)

Compilation message (stdout)

Compiling 'Mountains.py'...

=======
  adding: __main__.pyc (deflated 32%)

=======

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 36 / 36
• Subtask 5: 28 / 28
• Subtask 6: 0 / 9
• Subtask 7: 0 / 12