As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定一个长度为 $n$ 的序列，你需要找到一个最长的子序列，使得这个子序列的最长上升子序列长度小于原序列的最长上升子序列长度。
第一行一个正整数 $n$ 。
第二行 $n$ 个正整数 $a_1,a_2,\cdots,a_n$ 。
一行一个正整数，表示最长的合法子序列长度。
6 4 6 5 2 1 3
4
见下发文件。
对于所有数据，$1\le n\le 5\times 10^5$，$1\le a_i\le 10^9$ 。
时间限制：$\texttt{1s}$
空间限制：$\texttt{512MB}$
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: