题目 | Yet Another Monster Fight
Educational Codeforces Round 158 (Rated for Div. 2)
D. Yet Another Monster Fight
题目 | Candy Party
Codeforces Round 896 (Div. 2)
D1. Candy Party (Easy Version)
D2. Candy Party (Hard Version)
https://codeforces.com/contest/1869/problem/D1
题目 | Circle of Mistery
算法 | 最长上升子序列
最长上升子序列 (LIS, Longest Increasing Subsequence)：在给定序列中找到最长的子序列，满足子序列升序。