动态规划求解:
dp[i]表示以f[i]为结尾的最长递增子序列的长度
如果dp[i]>dp[j]&&0<=j<i,那么dp[i]=max(dp[0],dp[1],.....dp[i-1])+1
我一开始的误解:dp[n-1]就是最长递增子序列的长度,当然不是,它只表示以f[i]结尾的长度,最长递增子序列不一定以f[i]结尾
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.Input
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
7 1 7 3 5 9 4 8Sample Output
4
AC代码 🐱🏍
#include<iostream>
#include<string.h>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main()
{
int n,i,j,ans,a[10010],f[10010];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
// memset(f,0,sizeof(f));
for(i=1;i<=n;i++)
{
f[i]=1;
for(j=1;j<i;j++)
{
if(a[j]<a[i]) //!!!
f[i]=max(f[i],f[j]+1);
}
}
ans=0;
for(i=1;i<=n;i++)
{
ans=max(ans,f[i]);
}
printf("%d\n",ans);
return 0;
}