# n = int(input())
# arr = [0 for _ in range(n)]
# for i in range(n):
# arr[i] = int(input())
# sum = int(0)
# for k in range(n):
# for a in range(k, -1, -1):
# if a <= 0 or arr[k] <= arr[a]: break
# elif arr[k] > arr[a]:
# for a in range(k, n):
# if a >= (n - 1) or arr[k] <= arr[a]:
# break
# elif arr[k] > arr[a]:
# sum += 1
# print(sum)
# n = int(input())
# arr = [0 for _ in range(n)]
# for i in range(n):
# arr[i] = int(input())
# arr.reverse()
# sum = 0
# max = -1
# for i in range(n):
# if arr[i] > max:
# max = arr[i]
# sum += 1
# print(sum)
# n = int(input())
# stack = []
# # arr = []
# for i in range(n):
# a = int(input())
# while len(stack)!=0 and stack[-1]<=a :
# stack.pop()
# stack.append(a)
# print(len(stack))
n = int(input())
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
20240420
20240420
댓글 0개
좋아요
댓글(0)
bottom of page