Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 70079 Accepted: 31261
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.
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[i]表示以第i个元素结尾的上升子序列的最大长度。然后从所有dp[i]中找到最大的即可。
代码如下
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e3+5;
int lis(int d[],int n){
int i,j,maxn, dp[N];
maxn=1;
for(i=0;i<n;i++){
dp[i]=1;
for(j=i-1;j>=0;j--)
if(d[i]>d[j]) dp[i]=max(dp[i],dp[j]+1);
maxn=max(maxn,dp[i]);
}
return maxn;
}
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n,a[N];
while(cin>>n){
for(int i=0;i<n;i++) cin>>a[i];
cout<<lis(a,n)<<endl;
}
return 0;
}