Loading

摘要: 3.21 DP CF2075F Beautiful Sequence Returns 给长为 \(n\) 的数组 \(a\),求最长的子序列 \(b_{1\dots k}\),满足: \(\forall i\in[2,k],\exist j<i,b_j<b_i\) \(\forall i\in[1, 阅读全文
posted @ 2025-03-25 15:25 Mathew_Miao 阅读(30) 评论(0) 推荐(0)