题解

#include <bits/stdc++.h>
using namespace std;
const unsigned MAX=1e6+5;
unsigned n,a[MAX],dp[MAX],temp,maxx=0;

int main(){
	cin>>n;
	for (int i=0;i<n;i++) cin>>a[i];
	
	for (int i=0;i<n;i++){
		temp=1;
		for (int j=0;j<i;j++){
			
			if (a[j] < a[i]) temp = max(temp,dp[j]+1);
		}
		dp[i] = temp;
	}
	
	for (int i=0;i<n;i++) maxx = max(dp[i],maxx);
	
	cout<<maxx;
	return 0;
}