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))

Compiling 'triusis.py'...

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

=======