結果

問題 No.1827 最長部分スーパーリッチ門松列列
ユーザー chineristAC
提出日時 2022-01-28 23:11:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 322 ms / 2,000 ms
コード長 2,965 bytes
コンパイル時間 384 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 190,060 KB
最終ジャッジ日時 2024-12-30 11:12:52
合計ジャッジ時間 7,989 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

class SegmentTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.tree = [ide_ele] * 2 * self.num
self.size = n
for i in range(n):
self.tree[self.num + i] = init_val[i]
for i in range(self.num - 1, 0, -1):
self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, k, x):
k += self.num
self.tree[k] = self.segfunc(self.tree[k],x)
while k > 1:
k >>= 1
self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1])
def query(self, l, r):
if r==self.size:
r = self.num
res = self.ide_ele
l += self.num
r += self.num
right = []
while l < r:
if l & 1:
res = self.segfunc(res, self.tree[l])
l += 1
if r & 1:
right.append(self.tree[r-1])
l >>= 1
r >>= 1
for e in right[::-1]:
res = self.segfunc(res,e)
return res
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
def _solve(N,P):
pos = [-1] * N
for i in range(N):
pos[P[i]] = i
exist = [False] * N
tmp = 0
res = 0
last = -1
for i in range(N):
tmp += 1
if pos[i]!=0 and exist[pos[i]-1]:
tmp -= 1
if pos[i]!=N-1 and exist[pos[i]+1]:
tmp -= 1
if pos[i]==N-1:
last = N-1
if last==-1:
res = max(res,2*tmp)
else:
res = max(res,2*tmp-1)
exist[pos[i]] = True
return res
def solve(N,P):
P = [p-1 for p in P]
res = _solve(N,P)
P = [N-1-p for p in P]
res = max(res,_solve(N,P))
return res
def brute(N,P):
res = 0
for S in range(1,1<<N):
A = []
for i in range(N):
if S>>i & 1:
A.append(P[i])
if len(A)==1:
res = max(res,1)
continue
M = max(A[i] for i in range(0,len(A),2))
m = min(A[i] for i in range(1,len(A),2))
if M < m:
res = max(res,len(A))
M = max(A[i] for i in range(1,len(A),2))
m = min(A[i] for i in range(0,len(A),2))
if M < m:
res = max(res,len(A))
return res
for _ in range(0):
N = random.randint(5,15)
P = [i+1 for i in range(N)]
random.shuffle(P)
if solve(N,P)!=brute(N,P):
print(N)
print(P)
break
for _ in range(int(input())):
N = int(input())
P = li()
print(solve(N,P))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0