题目描述
blablabla
样例
blablabla
算法1
$O(nlog(n)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
include [HTML_REMOVED]
include [HTML_REMOVED]
include [HTML_REMOVED]
using namespace std;
const int N = 1010;
int a[N],b[N];
int res;
int n;
int find(int x)
{
int l=1,r=res;
while(l[HTML_REMOVED]=x) r=mid;
else l=mid+1;
}
return l;
}
int main()
{
int n;
cin>>n;
for (int i = 1; i <= n; i ++ ) scanf(“%d”, &a[i]);
b[0]=-2e9;
for (int i = 1; i <= n; i ++ )
{
if(a[i]>b[res]) b[++res]=a[i];
else
{
int s=find(a[i]);
b[s]=a[i];
}
}
cout<<res;
return 0;
}