链接:
https://vjudge.net/contest/163018#problem/I
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<algorithm>
#include<iostream>
#include<set>
using namespace std;
//求最长上升子序列的长度
const int mmax = 600100;
const int inf = 0x3f3f3f3f;
int dp[mmax],data[mmax],da[mmax];
int n,m,k;
int main()
{
while(cin>>n)
{
set<int>o;
int num;
set<int>::iterator it;
for(int i=1;i<=n;i++)
{
scanf("%d",&num);
if(o.empty())
o.insert(num);
else
{
it = o.lower_bound(num);
if(it!=o.end())
o.erase(it);
o.insert(num);
}
}
printf("%d\n",o.size());
//最后得到的是一个递减数列
}
return 0;
}