# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1149426 | maomao | Mountains (NOI20_mountains) | Pypy 3 | 2097 ms | 97188 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
for j in range(0,i):
if height[j]<height[i]:
left +=1
for j in range(i+1,n):
if height[j]<height[i]:
right+=1
ans += left*right
print(ans)
컴파일 시 표준 출력 (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... |