defstart_length(s):
n = len(s)
f = [1]*len(s)
for i in range(n-2,-1,-1):
if s[i] < s[i+1]:
f[i] = f[i+1] + 1return f
defend_length(s):
n = len(s)
G = [1]*n
for i in range(1,n):
if s[i-1]<s[i]:
G[i] = G[i-1]+1return G
deffind_seq(s):
m = 0
n = len(s)
F,G = start_length(s),end_length(s)
print(F,G)
for i in range(1,n):
for j in range(i,n-1):
if s[i-1] <s[j+1]:
m = max(m,G[i-1]+F[j+1])
print(m)
defgrowth_seq(s,g,i):
n = len(s)
i+=1while i < n and (len(g)==0or g[-1]<s[i]):
g.append(s[i])
i+=1deffind_seq2(s):
n = len(s)
m = 0
left = deque()
left.append(s[0])
for i in range(1,n):
right = deque()
while j<n-1:
if len(right)==0:
growth_seq(s,right,j)
if s[i-1]<s[j+1]:
m = max(m,len(left)+len(right))
right.popleft()
while len(left) and left[-1] > s[i]:
left.pop()
left.append(s[i])
print(m)