Problem:


Score : 500 points

Problem Statement

You are given a sequence with N integers: A = \{ A_1, A_2, \cdots, A_N \}.
For each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:

If A_i and A_j (i < j) are painted with the same color, A_i < A_j.

Find the minimum number of colors required to satisfy the condition.

Constraints

1 \leq N \leq 10^5

0 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print the minimum number of colors required to satisfy the condition.

Sample Input 1

5
2
1
4
5
3

Sample Output 1

2

We can satisfy the condition with two colors by, for example, painting 2 and 3 red and painting 1, 4, and 5 blue.

Sample Input 2

4
0
0
0
0

Sample Output 2

4

We have to paint all the integers with distinct colors.



Sample input:
5
2
1
4
5
3


Sample output:
2

Submission status: Time Limit Exceeded

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    N = r_int()
    A = [r_int() for _ in range(N)]
    dp = [[-1]*(N+1) for _ in range(N+1)]
    # search maximum length
    for i in range(N+1):
        dp[0][i] = INF
    for j in range(N):
        for i in range(N):
            dp[i][j+1] = max(dp[i][j], dp[i][j+1])
            if dp[i][j] >= A[j]:
                dp[i+1][j+1] = A[j]
    for i in range(N, -1, -1):
        if dp[i][N] != -1:
            print(i)
            return
    print(-1)
    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


n = I()
A = IR(n)
LIS = [A[0]]
for i in range(1, n):
    if A[i] <= LIS[0]:
        LIS = [A[i]] + LIS
    else:
        LIS[bisect_left(LIS, A[i]) - 1] = A[i]


print(len(LIS))

Submission status: Time Limit Exceeded

Solution code:
import sys
import bisect

stdin = sys.stdin
 
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip()  # ignore trailing spaces

N = ri()
A = [ri() for _ in range(N)]
l = []
for a in A:
    i = bisect.bisect_left(l, a)
    if i == 0:
        l = [a] + l
    else:
        l[i-1] = a

print(len(l))
#39

Submission status: Time Limit Exceeded

Solution code:
import sys
import bisect

stdin = sys.stdin
 
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip()  # ignore trailing spaces

N = ri()
A = [ri() for _ in range(N)]
l = []
for a in A:
    i = bisect.bisect_left(l, a)
    if i == 0:
        l.insert(0, a)
    else:
        l[i-1] = a

print(len(l))
#39

Submission status: Time Limit Exceeded

Solution code:
#%%
import bisect

n = int(input())
a = [0] * n
for i in range(n):
    a[i] = int(input())

ans_list = []
for i in range(n):
    tmp = bisect.bisect_left(ans_list, a[i])
    #print(tmp)
    if tmp == 0:
        ans_list.insert(0, a[i])
    else:
        ans_list[tmp-1] = a[i]
    #print(ans_list)
print(len(ans_list))

Submission status: Time Limit Exceeded

Solution code:
import heapq
N = int(input())
A = [int(input()) for i in range(N)]
hq = []
for i in range(N):
    Atup = (A[i],i)
    heapq.heappush(hq, Atup)
ans = 0
for _ in range(len(hq)):
    if hq == []:    break

    base = heapq.heappop(hq)
    hqtmp = []
    for i in range(len(hq)):
        cmp = heapq.heappop(hq)
        if base[1] < cmp[1] and base[0] < cmp[0]:
            base = cmp
        else:
            heapq.heappush(hqtmp, cmp)
    for i in hqtmp:
        heapq.heappush(hq, i)
    ans += 1

print(ans)

Submission status: Time Limit Exceeded

Solution code:
import heapq
N = int(input())
A = [int(input()) for i in range(N)]
hq = []
for i in range(N):
    Atup = (A[i],i)
    heapq.heappush(hq, Atup)
ans = 0
for _ in range(len(hq)):
    if hq == []:    break
    
    base = heapq.heappop(hq)
    hqtmp = []
    for i in range(len(hq)):
        cmp = heapq.heappop(hq)
        if base[1] < cmp[1] and base[0] < cmp[0]:
            base = cmp
        else:
            heapq.heappush(hqtmp, cmp)
    for i in hqtmp:
        heapq.heappush(hq, i)
    ans += 1

print(ans)

Submission status: Time Limit Exceeded

Solution code:
import heapq
N = int(input())
A = [int(input()) for i in range(N)]
hq = []
for i in range(N):
    Atup = (A[i],i)
    heapq.heappush(hq, Atup)
ans = 0
while hq != []:
    base = heapq.heappop(hq)
    hqtmp = []
    for i in range(len(hq)):
        cmp = heapq.heappop(hq)
        if base[1] < cmp[1] and base[0] < cmp[0]:
            base = cmp
        else:
            heapq.heappush(hqtmp, cmp)
    for i in hqtmp:
        heapq.heappush(hq, i)
    ans += 1

print(ans)

Submission status: Time Limit Exceeded

Solution code:
import bisect


def sequence_decomposing(N: int, A: list)->int:
    mins = [A[0]]

    for a in A[1:]:
        i = bisect.bisect_left(mins, a)
        if i == 0:
            mins = [a] + mins
        else:
            mins[i-1] = a

    return len(mins)


if __name__ == "__main__":
    N = int(input())
    A = [int(input()) for _ in range(N)]
    ans = sequence_decomposing(N, A)
    print(ans)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[0]*n
for i in range(n):
    a[i]=int(input())
iro=[0]
iro[0]=a[0]

for i in range(1,n):

    flag=True
    for j in range(len(iro)-1):
        if a[i]>iro[j] and a[i]<=iro[j+1]:
            iro[j]=a[i]
            flag=False
    if a[i]>iro[-1]:
        iro[-1]=a[i]
        flag=False
    if flag:
        iro.append(a[i])
#print(iro)
print(len(iro))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[0]*n
for i in range(n):
    a[i]=int(input())
iro=[0]
iro[0]=a[0]
for i in range(1,n):
    iro.sort()
    flag=True
    for j in range(len(iro)-1):
        if a[i]>iro[j] and a[i]<=iro[j+1]:
            iro[j]=a[i]
            flag=False
    if a[i]>iro[-1]:
        iro[-1]=a[i]
        flag=False
    if flag:
        iro.append(a[i])
#print(iro)
print(len(iro))

Submission status: Time Limit Exceeded

Solution code:
from collections import Counter,defaultdict,deque
import sys
import copy
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
    
def inp(): # n=1
    return int(input())
def inpm(): # x=1,y=2
    return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
    return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
    return list(input().split())
def inplm(n): # x=[] 複数行
    return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
    return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    n=inp()
    a=inplm(n)
    aa=[-1 for _ in range(10**5)]
    index=0
    for i in range(n):
        for j in range(10**5):
            if a[i]>aa[j]:
                aa[j]=a[i]
                if index<j:
                    index=j
                break
    print(index+1)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
"""import bisect
lst=[i for i in range(100)]
lst.reverse()
print(bisect.bisect_left(lst,1))
exit()
"""
N=int(input())
A=[int(input()) for i in range(N)]
B=[0 for i in range(N)]
C=sorted(A)
count=0
lst=[]
lstm=0
for i in range(N):
    if A[i]==C[-1]:

        if not lst:
            C.pop()
            count+=1
            continue
    flag=1
    for l in range(len(lst)):
        if lst[l]<A[i]:
            lst[l]=A[i]
            flag=0
            break
    if flag:
        lst.append(A[i])
        count+=1
    #print(count,i,lst)
print(count)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
B=[0 for i in range(N)]
C=sorted(A)
count=0
lst=[]
lstm=0
for i in range(N):
    flag=1
    for l in range(len(lst)):
        if lst[l]<A[i]:
            lst[l]=A[i]
            flag=0
            break
    if flag:
        lst.append(A[i])
        count+=1
    #print(count,i,lst)
print(count)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

N=int(input())
A=np.array([int(input()) for i in range(N)],dtype=np.int32)
B=[0 for i in range(N)]
C=sorted(A)
count=0
for i in range(N):

    if B[i]:
        continue

    else:
        temp=A[i]
        for m in range(i,N):
            if not B[m]:
                if A[m]==C[-1]:
                    B[m]=1
                    C.pop()
                    break
                else:
                    if temp<A[m]:
                        temp=A[m]
                        B[m]=1
        count+=1
    #print(i,count,B)
print(count)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
B=[0 for i in range(N)]
C=sorted(A)
count=0
for i in range(N):

    if B[i]:
        continue

    else:
        temp=A[i]
        for m in range(i,N):
            if not B[m]:
                if A[m]==C[-1]:
                    B[m]=1
                    C.pop()
                    break
                else:
                    if temp<A[m]:
                        temp=A[m]
                        B[m]=1
        count+=1
    #print(i,count,B)
print(count)

Submission status: Time Limit Exceeded

Solution code:
from bisect import bisect_right, insort_right

N = int(input())
A = [int(input()) for _ in range(N)]
B = [A[-1]]
for a in reversed(A[:-1]):
    idx = bisect_right(B, a)
    if idx == len(B):
        insort_right(B, a)
    else:
        B[idx] = a
        B.sort()
print(len(B))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = [int(input())]
import bisect
from collections import deque
for i in range(1, n):
  a = int(input())
  p = bisect.bisect_left(l,a)
  if p == 0:
    l = deque(l)
    l.appendleft(a)
    l = list(l)
  else:
    l[p-1] = a

print(len(l))

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
n = int(input())
a = [int(input()) for _ in range(n)]
memo = []
ans = 0
for ai in a:
    if not memo or memo[-1] >= ai:
        memo.append(ai)
    else:
        for i in range(len(memo)):
            if memo[i] < ai:
                memo[i] = ai
                break
print(len(memo))

Submission status: Time Limit Exceeded

Solution code:
import bisect
n = int(input())
c = [int(input())]
for i in range(n-1):
  a = int(input())
  if c[-1] >= a:
    c.append(a)
  else:
    ind = bisect.bisect_left(c[::-1],a)
    c[len(c)-ind] = a
print(len(c))

Submission status: Time Limit Exceeded

Solution code:
import bisect
import sys
input = sys.stdin.readline
N = int(input())
A = [int(input()) for i in range(N)]
B = [A[0]]
tmp = [0]*N
ans = 1
for i in range(1, N):
    id = bisect.bisect_left(B, A[i])
    if id == 0:
        bisect.insort_left(B, A[i])
    else:
        B[id-1] = A[i]
print(len(B))

Submission status: Time Limit Exceeded

Solution code:
import bisect
N = int(input())
A = [int(input()) for i in range(N)]
B = [A[0]]
tmp = [0]*N
ans = 1
for i in range(1, N):
    id = bisect.bisect_left(B, A[i])
    if id == 0:
        bisect.insort_left(B, A[i])
    else:
        B[id-1] = A[i]
print(len(B))

Submission status: Time Limit Exceeded

Solution code:
import bisect

N=int(input())
A=[int(input()) for i in range(N)]

B=[]
for a in A:
  p=bisect.bisect_left(B,a)
  if p==0:
    B.insert(0,a)
  else:
    B[p-1]=a

print(len(B))

Submission status: Time Limit Exceeded

Solution code:
import bisect

n=int(input())
a=[int(input()) for i in range(n)]

c=0
b=[]
for i in range(n):
  p=bisect.bisect_left(b,a[i])
  if p==0:
    b.insert(0,a[i])
    c += 1
  else:
    b[p-1]=a[i]

print(c)

Submission status: Time Limit Exceeded

Solution code:
import bisect

n=int(input())
a=[int(input()) for i in range(n)]

c=0
b=[]
for i in range(n):
  p=bisect.bisect_left(b,a[i])
  if p==0:
    b.append(a[i])
    c += 1
  else:
    b[p-1]=a[i]
  b.sort()

print(c)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]

b=[]
c=0
while len(a)>0:
  r=-1
  c+=1
  for i in range(len(a)):
    if a[i]<=r:
      b.append(a[i])
    else:
      r=a[i]
  a=b
  b=[]

print(c)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [-1]
import bisect
for i in range(N):
    a = int(input())
    index = bisect.bisect_left(A,a)
    if index >= 1:
        A[index-1] = a
    else:
        A.insert(0,a)
ans = len(A)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
l=[]
for i in range(n):
  l.append(int(input()))
l1=[[l[0]]]
for i in range(1,n):
  b=True
  for j in range(len(l1)):
    if l1[j][-1]<l[i] and b:
      l1[j].append(l[i])
      b=False
  if b:
    l1.append([l[i]])
print(len(l1))

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

import bisect
n = int(input())

a = [int(input()) for i in range(n)]

color = [a[0]]

for i in range(1,n):
    idx = bisect.bisect_left(color,a[i])
    if idx == 0:
        color.insert(0,a[i])
    else:
        color[idx-1] = a[i]
        
print(len(color))

Submission status: Time Limit Exceeded

Solution code:
import bisect
n = int(input())

a = [int(input()) for i in range(n)]

color = [a[0]]

for i in range(1,n):
    idx = bisect.bisect_left(color,a[i])
    if idx == 0:
        color.insert(0,a[i])
    else:
        color[idx-1] = a[i]
        
print(len(color))

Submission status: Time Limit Exceeded

Solution code:
import heapq

N = int(input())
que = []
tmp = []
A1 = int(input())
heapq.heappush(que, A1*-1)
for _ in range(N-1):
    a = int(input())
    while True:
        if len(que) == 0:
            heapq.heappush(que, a*-1)
            break
        A = heapq.heappop(que)*-1
        if A < a:
            heapq.heappush(que, a*-1)
            break
        else:
            tmp.append(A)

    for val in tmp:
        heapq.heappush(que, val*-1)
    tmp = []

print(len(que))

Submission status: Time Limit Exceeded

Solution code:
import bisect

n = int(input())
A = [int(input()) for i in range(n)]

Q = [A[0]] + [float("inf")] * (n+1)
le = 1
for i in range(1, n):
    if Q[le-1] >= A[i]:
        Q[le] = A[i]
        le += 1
    else:
        ind = bisect.bisect_left(Q[:le][::-1], A[i])
        Q[le-ind] = A[i]
    # print(Q[:10])

print(le)

Submission status: Time Limit Exceeded

Solution code:
import bisect

N=int(input())
A=[int(input()) for i in range(N)]
lst=[A[-1]]
nowN=max(A)+1
i=len(A)-2
while i>=0:
    #print(lst)
    if max(lst)>A[i]:
        maxvalue=0
        maxvaluei=100000
        for n in range(len(lst)):
            if lst[n]>A[i] and lst[n]>maxvalue:
                maxvalue=lst[n]
                maxvaluei=n
        lst[maxvaluei]=A[i]
                #break
    else:
        lst.append(A[i])

    i-=1
print(len(lst))

Submission status: Time Limit Exceeded

Solution code:
import bisect

N=int(input())
A=[int(input()) for i in range(N)]
lst=[[A[-1]]]
nowN=max(A)+1
i=len(A)-2
while i>=0:
    #print(lst)
    lst2=[n[-1] for n in lst]
    if max(lst2)>A[i]:
        maxvalue=0
        maxvaluei=100000
        for n in range(len(lst2)):
            if lst2[n]>A[i] and lst2[n]>maxvalue:
                maxvalue=lst2[n]
                maxvaluei=n
        lst[maxvaluei].append(A[i])
                #break
    else:
        lst.append([A[i]])

    i-=1
print(len(lst))