Submission #632238

#TimeUsernameProblemLanguageResultExecution timeMemory
632238beaconmcGlobal Warming (CEOI18_glo)Pypy 3
28 / 100
2075 ms44756 KiB
from bisect import *

n,x = map(int, input().split())

arr = list(map(int, input().split()))



def LIS(lis):
    dp = []
    for i in lis:
        sus = bisect_left(dp,i)
        if sus==len(dp):
            dp.append(i)
        else:
            dp[sus] = i

    return len(dp)

ans = LIS(arr)
for i in range(len(arr)):
    arr[i] -= x
    ans = max(ans, LIS(arr))

print(ans)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...