LIS(DP)

/*复杂度n^2*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream> 
using namespace std;
int main(){
	int arr[500], n, dp[500], ans=-1;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&arr[i]);
	}
	
	for(int i=1;i<=n;i++){
		dp[i]=1;
		for(int j=1;j<i;j++){
			if(arr[i]>arr[j]){
				dp[i]=max(dp[i],dp[j]+1);
			}
		}
		ans=max(ans,dp[i]);
	}
	cout<<"最长上升子序列为"<<ans;
	return 0;
} 

//n*logn
#include<iostream>
using namespace std;
const int maxn=1e5+5;
int a[maxn],low[maxn];

int binary_search(int r, int x)
{
	int l=0;
	while(l<r){
		int mid=(l+r)>>1;
		if(low[mid]>=x){
			r=mid;
		}
		else{
			l=mid+1;
		}		
	}
	return  l;
}
int main(){
	int n; cin>>n;
	int len=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		int k=binary_search(len,a[i]);
		low[k]=a[i];
		if(k==len){
			len++;
		}
	}		
	cout<<len;
} 
 

 

推荐的dp链接：https://blog.csdn.net/lxt_Lucia/article/details/81206439?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159966330519725247457932%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=159966330519725247457932&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_ecpm_v3~pc_rank_v4-4-81206439.first_rank_ecpm_v3_pc_rank_v4&utm_term=LIS&spm=1018.2118.3001.4187

https://blog.csdn.net/ltrbless/article/details/81318935?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-2.channel_param&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-2.channel_param