Longest Ordered Subsequence
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 46261 | Accepted: 20528 |
Description
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.
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 8
Sample Output
4
很简单的DP,dp【0】=1,然后从第二个开始从前面找一个比它小的并且是DP值最大的,然后此时的DP值就是MAX+1咯
然后就是每个dp值中最大的就可以了。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
using namespace std;
int a[1005],b[1005];
int n;
int main()
{
int i,j;
scanf("%d",&n);
for(i=0;i<n;++i)
{
scanf("%d",&a[i]);
}
int ans=1;
b[0]=1;
for(i=1;i<n;++i)
{
int MAX=0;
for(j=0;j<i;++j)
{
if(a[j]<a[i]&&b[j]>MAX)
{
MAX=b[j];
}
}
b[i]=MAX+1;
ans=max(ans,b[i]);
}
printf("%d\n",ans);
return 0;
}