結果

問題 No.1188 レベルX門松列
ユーザー KeroruKeroru
提出日時 2020-08-24 16:09:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 303 ms / 2,000 ms
コード長 3,990 bytes
コンパイル時間 467 ms
コンパイル使用メモリ 82,612 KB
実行使用メモリ 104,848 KB
最終ジャッジ日時 2024-11-06 10:21:59
合計ジャッジ時間 7,438 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 249 ms
101,680 KB
testcase_01 AC 282 ms
100,716 KB
testcase_02 AC 279 ms
99,508 KB
testcase_03 AC 303 ms
101,660 KB
testcase_04 AC 295 ms
104,848 KB
testcase_05 AC 153 ms
92,552 KB
testcase_06 AC 235 ms
100,196 KB
testcase_07 AC 293 ms
104,312 KB
testcase_08 AC 295 ms
104,564 KB
testcase_09 AC 153 ms
92,556 KB
testcase_10 AC 152 ms
92,680 KB
testcase_11 AC 208 ms
93,128 KB
testcase_12 AC 201 ms
93,520 KB
testcase_13 AC 202 ms
93,356 KB
testcase_14 AC 260 ms
97,832 KB
testcase_15 AC 302 ms
102,300 KB
testcase_16 AC 178 ms
93,244 KB
testcase_17 AC 281 ms
99,812 KB
testcase_18 AC 155 ms
92,588 KB
testcase_19 AC 281 ms
99,928 KB
testcase_20 AC 149 ms
92,628 KB
testcase_21 AC 156 ms
92,788 KB
testcase_22 AC 157 ms
92,596 KB
testcase_23 AC 154 ms
92,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1,ls=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print((a1,a2),inp)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**9)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()


def compress(L):
    dc={v:i for i,v in enumerate(sorted(set(L)))}
    return [dc[i] for i in L]


show_flg=False
show_flg=True

ans=0

n=I()
a=LI()
#a=compress(LI())


s=[]
l=[0]*n
r=[0]*n
for i in range(n):
    idx=bisect.bisect_left(s,a[i])
    if idx==len(s):
        s+=a[i],
    else:
        s[idx]=a[i]
    l[i]=idx

a=a[::-1]
s=[]
for i in range(n):
    idx=bisect.bisect_left(s,a[i])
    if idx==len(s):
        s+=a[i],
    else:
        s[idx]=a[i]
    r[i]=idx
r=r[::-1]
a=a[::-1]

ans=0
for i in range(n):
    ans=max(min(l[i],r[i]),ans)


a=[-i for i in a]

s=[]
l=[0]*n
r=[0]*n
for i in range(n):
    idx=bisect.bisect_left(s,a[i])
    if idx==len(s):
        s+=a[i],
    else:
        s[idx]=a[i]
    l[i]=idx

a=a[::-1]
s=[]
for i in range(n):
    idx=bisect.bisect_left(s,a[i])
    if idx==len(s):
        s+=a[i],
    else:
        s[idx]=a[i]
    r[i]=idx
r=r[::-1]
a=a[::-1]

for i in range(n):
    ans=max(min(l[i],r[i]),ans)

print(ans)
0