제출 #382947

#제출 시각아이디문제언어결과실행 시간메모리
382947AlexandraBaloni (COCI15_baloni)Cpython 3
40 / 100
2095 ms104828 KiB
n = int(input())
h = input().split()
h = list(map(int, h))
resp = 0
rotos = []

try:
  for i in range (len(h)):
    rotos = []
    target = max(h)
    arrow = target - 1
    o = h.index(target)
    rotos.append(o)
    resp += 1

    for j in range (o+1, len(h)):
      if h[j] == arrow:
        arrow -= 1
        rotos.append(j)

    rotos.sort(reverse=True)
    for j in range (len(rotos)):
      h.pop(rotos[j])

  print (str(resp))

except:
  print (str(resp))
#Verdict Execution timeMemoryGrader output
Fetching results...