class Solution(): def fun(self, line, n): if n < 1: return 0 if n == 1: return 1 dp = [0] * n size = 0 for x in line: i, j = 0, size while i != j: m = (i + j) // 2 if dp[m] ...