소프티어

import sys

def solution(s, t):

  result = []

  for i in range(s):

    current_result = [t[i]]

    for j in range(i + 1, s):

      if t[j] > current_result[-1]:

        current_result.append(t[j])

    result.append(current_result)

  max_length = max(len(sublist) for sublist in result)

  return max_length