Submission #632801

#TimeUsernameProblemLanguageResultExecution timeMemory
632801beaconmcGlobal Warming (CEOI18_glo)Pypy 3
0 / 100
178 ms46132 KiB
from bisect import * n,x = map(int, input().split()) arr = list(map(int, input().split())) sussy2 = [0 for i in range(n)] sussy = [0 for i in range(n)] def LIS(lis): dp = [] cur = n-1 for i in lis: sus = bisect_left(dp,i) if sus==len(dp): dp.append(i) else: dp[sus] = i sussy2[cur] = len(dp) cur-=1 return len(dp) def LIS2(lis): dp = [] cur = 0 for i in lis: sus = bisect_left(dp,i) if sus==len(dp): dp.append(i) else: dp[sus] = i sussy[cur] = len(dp) cur+=1 return len(dp) LIS2(arr) LIS([-i for i in arr]) ans = 0 for i in range(n-1): ans = max(ans, sussy[i]+sussy2[i+1])
#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...