Submission #162371

#TimeUsernameProblemLanguageResultExecution timeMemory
162371boolodifjenulaBaloni (COCI15_baloni)Cpython 3
0 / 100
2066 ms95116 KiB
n=int(input()) L=list(map(int,input().split())) s=0 g1=L[0] m=sum(L) while m: s+=1 g=g1 g1=0 for i in range(len(L)): if g==L[i]: g-=1 m-=L[i] L[i]=0 elif g1==0: g1=L[i] if g<1 and g1 or g1 and g<min(L[i+1:]): break print(s)
#Verdict Execution timeMemoryGrader output
Fetching results...