結果

問題 No.1804 Intersection of LIS
ユーザー chineristACchineristAC
提出日時 2022-01-07 23:12:09
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 578 ms / 2,000 ms
コード長 2,497 bytes
コンパイル時間 363 ms
コンパイル使用メモリ 82,168 KB
実行使用メモリ 168,344 KB
最終ジャッジ日時 2024-11-14 09:13:33
合計ジャッジ時間 12,345 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import e, log,gcd

class UnionFindVerSize():
    def __init__(self, N):
        self._parent = [n for n in range(0, N)]
        self._size = [1] * N
        self.group = N

    def find_root(self, x):
        if self._parent[x] == x: return x
        self._parent[x] = self.find_root(self._parent[x])
        stack = [x]
        while self._parent[stack[-1]]!=stack[-1]:
            stack.append(self._parent[stack[-1]])
        for v in stack:
            self._parent[v] = stack[-1]
        return self._parent[x]

    def unite(self, x, y):
        gx = self.find_root(x)
        gy = self.find_root(y)
        if gx == gy: return

        self.group -= 1

        if self._size[gx] < self._size[gy]:
            self._parent[gx] = gy
            self._size[gy] += self._size[gx]
        else:
            self._parent[gy] = gx
            self._size[gx] += self._size[gy]

    def get_size(self, x):
        return self._size[self.find_root(x)]

    def is_same_group(self, x, y):
        return self.find_root(x) == self.find_root(y)

input = lambda :sys.stdin.readline()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N = int(input())
P = li()

dp = [N+1 for i in range(N+1)]
dp[0] = 0
for i in range(N):
    idx = bisect.bisect_right(dp,P[i])
    dp[idx] = P[i]
L = -1
for i in range(N+1):
    if dp[i]!=N+1:
        L = i

back = [0 for i in range(N+1)]
back[0] = N+1

use_bisect = [-back[i] for i in range(N+1)]

update = [None for i in range(N)]

for i in range(N)[::-1]:
    idx = bisect.bisect_right(use_bisect,-P[i])

    pre,next = back[idx],P[i]
    update[i] = (idx,back[idx],P[i])
    back[idx] = P[i]
    use_bisect[idx] = -P[i]

dp = [N+1 for i in range(N+1)]
dp[0] = 0
cnt = 0
for i in range(L+1):
    if dp[i] < back[L-i]:
        cnt += 1 
    
res = []
for i in range(N):
    idx_dp = bisect.bisect_right(dp,P[i])
    idx_back,_from,_to = update[i]

    if 1:
        if dp[L-idx_back] < back[idx_back]:
            cnt -= 1
        back[idx_back] = _from
        if dp[L-idx_back] < back[idx_back]:
            cnt += 1
    
    #print(dp)
    #print(back)
    #print(cnt)
    #print()
    
    
    if cnt==0:
        res.append(P[i])
    
    if dp[idx_dp] < back[L-idx_dp]:
        cnt -= 1
    dp[idx_dp] = P[i]
    if dp[idx_dp] < back[L-idx_dp]:
        cnt += 1

print(len(res))
print(*res)
0