Aizu - DPL_1_D Longest Increasing Subsequence dp+二分查找最长递增子序列

最新推荐文章于 2020-12-15 11:26:35 发布

萧瑟1

最新推荐文章于 2020-12-15 11:26:35 发布

阅读量173

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/qq_41410799/article/details/82852019

版权

动态规划专栏收录该内容

45 篇文章 0 订阅

订阅专栏

For a given sequence A = {a0, a1, ... , an-1}, find the length of the longest increasing subsequnece (LIS) in A.

An increasing subsequence of A is defined by a subsequence {ai0, ai1, ... , aik} where 0 ≤ i0 < i1 < ... < ik < n and ai0 < ai1 < ... < aik.

Input

n
a0
a1
:
an-1

In the first line, an integer n is given. In the next n lines, elements of A are given.

Output

The length of the longest increasing subsequence of A.

Constraints

1 ≤ n ≤ 100000
0 ≤ ai ≤ 109

Sample Input 1

Sample Output 1

Sample Input 2

Sample Output 2

n^2复杂度的算法过不了此题。。。

需要dp+二分过。。。

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=100005;
int n;
int a[maxn];
int dp[maxn];
int Max;
void init()
{
   Max=1;
   dp[0]=a[0];
}
int main()
{
    scanf("%d",&n);
    for (int i=0;i<n;i++)
        scanf("%d",&a[i]);
    init();
    for (int i=1;i<n;i++)
    {
        if(dp[Max-1]<a[i])
            dp[Max++]=a[i];
        else
            *lower_bound(dp,dp+Max,a[i])=a[i];
    }
    printf("%d\n",Max);
    return 0;
}