最长上升子序列
- 题目链接:最长上升子序列
- 思路 :找出i前面的最大长度,使得dp[i]的能取到当前长度的最大值
- 状态转移方程: dp[i] = max( dp[i] , dp[j]+1 ) j < i
#include<bits/stdc++.h>
#define maxn 2005
#define INF 0x3f3f3f3f
#define mst(a) memset(a,0,sizeof a)
#define ll long long
using namespace std;
int A[maxn];
int dp[maxn];
int main()
{
ios::sync_with_stdio(false);
int n;
cin >> n;
for(int i = 1; i<=n; i++) cin >> A[i];
int maxx = 0;
for(int i = 1; i<=n; i++)
{
dp[i] = 1;
for(int j = 1; j<=i; j++)
{
if(A[j]<A[i] ) dp[i] = max(dp[i],dp[j]+1);
}
maxx = max(dp[i],maxx);
}
cout<<maxx<<endl;
return 0;
}