3231. Minimum Number of Increasing Subsequence to Be Removed ============================================================ :题号: 3231 :题名: Minimum Number of Increasing Subsequence to Be Removed :类型: Premium(元数据占位) :难度: Hard :原题: `LeetCode 3231 `_ :数据源: LeetCode GraphQL :处理状态: 题目文件已建立;题目信息、题目重述与自建示例待下一轮补充。