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
大致题意:给你一列数,让你求最长递增子序列的长度
思路1:简单的dp,时间复杂度为n^2
代码如下
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<map>
using namespace std;
int a[1005],dp[1005];
int main()
{
for(int i=1;i<1005;i++)
dp[i]=1;
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=n-1;i>=1;i--)
for(int j=i+1;j<=n;j++)
{
if(a[i]<a[j])
dp[i]=max(dp[i],dp[j]+1);
}
int maxn=-1;
for(int i=1;i<=n;i++)
maxn=max(maxn,dp[i]);
cout<<maxn<<endl;
return 0;
}
思路2:采用之前说过的思路,用nlogn 的时间复杂度来解
http://blog.csdn.net/elbadaernu/article/details/64549007
代码如下
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#include<string>
#define LL long long
#define maxn 100000
using namespace std;
int d[maxn],n,b[maxn];
int LIS(){
b[1]=d[1];
int l,r,mid,len=1;
for(int i=2;i<=n;i++){
l=1;
r=len;
while(l<=r){
mid=(l+r)/2;
if(b[mid]<d[i]) l=mid+1;
else r=mid-1;
}
b[l]=d[i];
if(l>len) len++;
}
return len;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>d[i];
int len=LIS();
cout<<len;
return 0;
}