最长递增子序列

水题

#include<iostream>#include<stdio.h>#include<cstring>#include<string>#include<stack>#include<queue>#include<functional>#include<set>#include<map>#include<cstdlib>#include<vector>#include<cmath>#include <algorithm>#pragma warning(disable:4996)using namespace std;int a[1010];int dp[1010];int main(){int n,i,j;while (~scanf("%d",&n)){for (i = 0; i < n; i++){scanf("%d", &a[i]);dp[i] = 1;}for(i=1;i<n;i++)for (j = 0; j < i; j++)if(a[i]>a[j])dp[i] = max(dp[j]+1, dp[i]);printf("%d", *max_element(dp,dp+n));}return 0;}