题目 | Bracket Coloring
Educational Codeforces Round 149 (Rated for Div. 2)
D. Bracket Coloring
算法 | 最长公共上升子序列
最长公共上升子序列 (LCIS, Longest Common Increasing Subsequence)：在给定两个序列中找到最长的公共子序列，满足子序列升序。
题目 | A Wide, Wide Graph
题目 | Climbing the Tree
CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!)
D. Climbing the Tree
算法 | 最长上升子序列
最长上升子序列 (LIS, Longest Increasing Subsequence)：在给定序列中找到最长的子序列，满足子序列升序。