poj 2253

代码如下

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;int a[1005];int dp[1005];int los(int n){for(int i=0;i<n;i++)dp[i]=10005;for(int i=0;i<n;i++)*lower_bound(dp,dp+n,a[i])=a[i];return lower_bound(dp,dp+n,10005)-dp;}int main(){int n;scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",&a[i]);printf("%d\n",los(n)); }