【PER #1】子序列 - 問題

#21631. 【PER #1】子序列

統計

この問題は以下のコンテストで使用されています：

Public Easy Round #1

给定一个长度为 $n$ 的序列，你需要找到一个最长的子序列，使得这个子序列的最长上升子序列长度小于原序列的最长上升子序列长度。

输入格式

第一行一个正整数 $n$ 。

第二行 $n$ 个正整数 $a_1,a_2,\cdots,a_n$ 。

输出格式

一行一个正整数，表示最长的合法子序列长度。

样例 $1$

input

6
4 6 5 2 1 3

output

样例 $2\sim 7$

见下发文件。

数据范围与提示

对于所有数据，$1\le n\le 5\times 10^5$，$1\le a_i\le 10^9$ 。

时间限制：$\texttt{1s}$

空间限制：$\texttt{512MB}$

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0