제출 #1309328

#제출 시각아이디문제언어결과실행 시간메모리
1309328yyrtcRabbit Carrot (LMIO19_triusis)Pypy 3
100 / 100
244 ms60516 KiB
from bisect import bisect_right
n,m=map(int,input().split())

lis=[]

for i in range(n):

    x=int(input())
    x=m*(i+1)-x

    if x<0:
        continue
    
    idx=bisect_right(lis,x)

    if idx==len(lis):
        lis.append(x)
    else:
        lis[idx]=x

print(n-len(lis))

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'triusis.py'...

=======
  adding: __main__.pyc (deflated 23%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...