This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
from bisect import *
n,x = map(int, input().split())
arr = list(map(int, input().split()))
arrneg = [-i for i in arr]
arrneg.reverse()
dp = [0 for i in range(n)]
dp2 = [0 for i in range(n)]
lis = []
for j in range(len(arr)):
i = arr[j]
sus = bisect_left(lis,i)
dp[j] = sus+1
if sus==len(lis):
lis.append(i)
else:
lis[sus] = i
lis = []
for j in range(len(arrneg)):
i = arrneg[j]
sus = bisect_left(lis,i)
sussy = bisect_left(lis,i+x)
dp2[j] = sussy+1
if sus==len(lis):
lis.append(i)
else:
lis[sus] = i
dp2.reverse()
maxi = 0
for i in range(len(dp)):
maxi = max(maxi, dp[i]+dp2[i]-1)
print(maxi)
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |