给出一个序列,找出不连续的最长上升/下降序列
/*最长上升子序列
复杂度O(n^2)
*/
#include<iostream>
#include<string.h>
#include<cstdio>
#include<queue>
using namespace std;
int d[10005];
int A[10005];
int LIS(int A[],int n)
{
int len = 1;
for(int i=0;i<n;i++)
{
d[i]=1;
for(int j=0;j<i;j++)
{
if(A[j]<=A[i] && (d[j]+1)>=d[i]) //如果是下降。这里为A[j]>=A[i]
d[i]=d[j]+1;
}
if(d[i]>len) len=d[i];
}
memset(d,0,sizeof(d));
return len;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>A[i];
cout<<LIS(A,n);
}
二分优化
/*最长上升子序列
复杂度O(n^2)
*/
#include<iostream>
#include<string.h>
#include<cstdio>
#include<queue>
#include<stack>
#include<malloc.h>
using namespace std;
int d[10005];
int A[10005];
//二分优化
int put(int arr[], int l, int r, int key)//在arr[l...r]中二分查找插入位置
{
int mid;
if (arr[r] <= key)
return r + 1;
while (l < r)
{
mid = l + (r - l) / 2;
if (arr[mid] <= key)
l = mid + 1;
else
r = mid;
}
return l;
}
int LIS(int A[], int n)
{
int i = 0, len = 1 ,next;
int* B = (int *)alloca(sizeof(int) * (n + 1));
B[1] = A[0];
for (i = 1;i < n;i++)
{
int next = put(B, 1, len, A[i]);
B[next] = A[i];
if (len < next) len = next;
}
return len;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>A[i];
cout<<LIS(A,n);
}