#include<iostream>
#include<cstdio>
#include<cstring>
#include<limits.h>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int N=1e4+10;
int a[1005],dp[1005];
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
cin>>a[i];
int ans=0;
for(int i=0;i<n;i++)
{
dp[i]=1;
for(int j=0;j<i;j++)
{
if(a[j]<a[i])
dp[i]=max(dp[i],dp[j]+1);
}
ans=max(ans,dp[i]);
}
cout<<ans<<endl;
}
}
二分法O(nlogn)
#include<algorithm>
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long ll;
int a[1050];
int lis[1050];
int main()
{
int n;
while(cin>>n)
{
for(int i=1;i<=n;i++)
cin>>a[i];
lis[1]=a[1];
int len=1;
for(int i=2;i<=n;i++){
if(a[i]>lis[len])
lis[++len]=a[i];
else{
int pos=lower_bound(lis+1,lis+1+len,a[i])-lis;
lis[pos]=a[i];
}
}
cout<<len<<endl;
}
}
https://vjudge.net/contest/454120#problem/FDP法O(n^2)#include<iostream>#include<cstdio>#include<cstring>#include<limits.h>#include<algorithm>#include<cmath>using namespace std;typedef long long ll;const int .