| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1147721 | maomao | Mountains (NOI20_mountains) | Pypy 3 | 2107 ms | 290272 KiB |
#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))
left = list(height[i] for i in range(0,m))
right = list(height[i] for i in range(m+1,len(height)))
ans += len(left)*len(right)
height.pop(m)
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... | ||||
