poj 2533 Longest Ordered Subsequence

最新推荐文章于 2022-08-10 14:58:35 发布

白白不狼

最新推荐文章于 2022-08-10 14:58:35 发布

阅读量139

点赞数

分类专栏： POJ dp

本文链接：https://blog.csdn.net/ac_blood/article/details/79869928

版权

POJ 同时被 2 个专栏收录

26 篇文章 0 订阅

订阅专栏

9 篇文章 0 订阅

订阅专栏

Longest Ordered Subsequence

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 59436		Accepted: 26637

Description

A numeric sequence of a_i is ordered if a₁ < a₂ < ... < a_N. Let the subsequence of the given numeric sequence ( a₁, a₂, ..., a_N) be any sequence ( a_i₁, a_i₂, ..., a_{i_K}), where 1 <= i₁ < i₂ < ... < i_K <= 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

题意：求最长上升子序列...

思路：模版题

ac代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

int a[4007], dp[4007];
int n;

int bin(int len,int k)
{
    int l = 1, r = len;
    while(l <= r)
    {
        int mid = (l+r)/2;
        if(k > dp[mid])
            l = mid+1;
        else
            r = mid-1;
    }
    return l;
}

int LIS(int *a)
{
    int i,j,ans=1;
    dp[1] = a[1];
    for(i = 2; i <= n; i++)
    {
        if(a[i] < dp[1])//如果比最小的还小 （纯升，不包含等于情况）
            j = 1;
        else if(a[i] > dp[ans])//如果比最大的还大
            j = ++ans;
        else
            j = bin(ans,a[i]);
        dp[j] = a[i];
    }
    return ans;
}

int LDS(float *a)
{

    int i,j,ans = 1;
    dp[1] = a[1];
    for(i = 1; i <= n; i++)
    {
        if(a[i] > dp[1])//如果比最大的还大
            j = 1;
        else if(a[i] < dp[ans])//如果比最小的还小（纯降 不包含等于情况）
            j = ++ans;
        else
            j = bin(ans,a[i]);
        dp[j] = a[i];
    }
    return ans;
}

int main()
{
    scanf("%d",&n);
    for(int i = 1; i <= n; i++)
        scanf("%d",&a[i]);

    int answer = LIS(a);
    printf("%d\n",answer);

    return 0;
}