最长递增子序列

//动态规划#include <cstdio>#include <cstring>#include <iostream>using namespace std;#define MAXN 10int dp[MAXN];int main(){int array[MAXN];int max=0;for(int i=0;i<MAXN;i++)cin>>array[i];for(int t=0;t<MAXN;t++)dp[t]=1;for(int i=1;i<MAXN;i++){for(int j=0;j<i;j++){if(array[i]>array[j]&&dp[i]<dp[j]+1)dp[i]=dp[j]+1;}if(dp[i]>max)max=dp[i];}cout<<max<<'\n';return 0;}