結果
問題 | No.992 最長増加部分列の数え上げ |
ユーザー | rlangevin |
提出日時 | 2024-01-30 12:21:46 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 824 ms / 2,000 ms |
コード長 | 2,357 bytes |
コンパイル時間 | 418 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 146,252 KB |
最終ジャッジ日時 | 2024-01-30 12:22:15 |
合計ジャッジ時間 | 28,244 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
55,608 KB |
testcase_01 | AC | 41 ms
55,608 KB |
testcase_02 | AC | 42 ms
55,608 KB |
testcase_03 | AC | 41 ms
55,608 KB |
testcase_04 | AC | 370 ms
95,952 KB |
testcase_05 | AC | 274 ms
91,596 KB |
testcase_06 | AC | 387 ms
100,524 KB |
testcase_07 | AC | 312 ms
94,028 KB |
testcase_08 | AC | 214 ms
85,924 KB |
testcase_09 | AC | 330 ms
94,096 KB |
testcase_10 | AC | 406 ms
100,524 KB |
testcase_11 | AC | 480 ms
107,468 KB |
testcase_12 | AC | 177 ms
82,448 KB |
testcase_13 | AC | 309 ms
94,660 KB |
testcase_14 | AC | 306 ms
94,172 KB |
testcase_15 | AC | 188 ms
83,160 KB |
testcase_16 | AC | 756 ms
134,752 KB |
testcase_17 | AC | 217 ms
85,920 KB |
testcase_18 | AC | 302 ms
94,116 KB |
testcase_19 | AC | 476 ms
107,316 KB |
testcase_20 | AC | 814 ms
145,424 KB |
testcase_21 | AC | 798 ms
145,044 KB |
testcase_22 | AC | 824 ms
146,088 KB |
testcase_23 | AC | 773 ms
145,336 KB |
testcase_24 | AC | 810 ms
145,944 KB |
testcase_25 | AC | 739 ms
145,344 KB |
testcase_26 | AC | 781 ms
145,552 KB |
testcase_27 | AC | 748 ms
145,572 KB |
testcase_28 | AC | 776 ms
145,556 KB |
testcase_29 | AC | 778 ms
146,252 KB |
testcase_30 | AC | 565 ms
141,964 KB |
testcase_31 | AC | 568 ms
142,372 KB |
testcase_32 | AC | 554 ms
141,984 KB |
testcase_33 | AC | 543 ms
141,492 KB |
testcase_34 | AC | 563 ms
141,624 KB |
testcase_35 | AC | 589 ms
140,764 KB |
testcase_36 | AC | 602 ms
140,768 KB |
testcase_37 | AC | 579 ms
140,764 KB |
testcase_38 | AC | 586 ms
140,764 KB |
testcase_39 | AC | 571 ms
140,764 KB |
testcase_40 | AC | 579 ms
136,628 KB |
testcase_41 | AC | 553 ms
136,652 KB |
testcase_42 | AC | 560 ms
136,404 KB |
testcase_43 | AC | 573 ms
136,940 KB |
testcase_44 | AC | 555 ms
136,420 KB |
ソースコード
from bisect import * from copy import * def compress(lst): B = [] D = dict() vals = deepcopy(lst) vals = list(set(vals)) vals.sort() for i in range(len(lst)): ind = bisect_left(vals, lst[i]) B.append(ind) for i in range(len(B)): D[lst[i]] = B[i] return B, D, vals class SegmentTree: def __init__(self, n, identity_e, combine_f, ): self._n = n self._size = 1 while self._size < self._n: self._size <<= 1 self._identity_e = identity_e self._combine_f = combine_f self._node = [self._identity_e] * (2 * self._size) def build(self, array): assert len(array) == self._n for index, value in enumerate(array, start=self._size): self._node[index] = value for index in range(self._size - 1, 0, -1): self._node[index] = self._combine_f( self._node[index << 1 | 0], self._node[index << 1 | 1] ) def update(self, index, value): i = self._size + index self._node[i] = value while i > 1: i >>= 1 self._node[i] = self._combine_f( self._node[i << 1 | 0], self._node[i << 1 | 1] ) def fold(self, L, R): L += self._size R += self._size value_L = self._identity_e value_R = self._identity_e while L < R: if L & 1: value_L = self._combine_f(value_L, self._node[L]) L += 1 if R & 1: R -= 1 value_R = self._combine_f(self._node[R], value_R) L >>= 1 R >>= 1 return self._combine_f(value_L, value_R) N = int(input()) A = list(map(int, input().split())) + [-10**18] A = compress(A)[0] mod = 10 ** 9 + 7 def op(t1, t2): m1, v1 = t1 m2, v2 = t2 if m1 == m2: return m1, (v1 + v2) % mod elif m1 > m2: return t1 else: return t2 T = SegmentTree(N + 1, (0, 0), op) T.update(0, (1, 1)) for i in range(N): t = T.fold(0, A[i]) now = T.fold(A[i], A[i] + 1) T.update(A[i], op((t[0] + 1, t[1]), now)) print(T.fold(0, N + 1)[1] % mod)