zoukankan      html  css  js  c++  java
  • POJ 2533 Longest Ordered Subsequence

    题目链接:

    http://poj.org/problem?id=2533

    Description

    A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1a2, ..., aN) be any sequence (ai1ai2, ..., 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


    Hint:

    题意:
    最长上升子序列
    题解:
    DP,还有注意这里的序列并非要连续的。
    代码:
    #include <cmath>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    const int maxn = 1000+10;
    #define inf 0x3f3f3f3f
    #define met(a,b) memeset(a,b,sizeof(a))
    int dp[maxn],a[maxn];
    int n;
    int DP()
    {
        for(int i=1;i<=n;i++)
        {
            dp[i]=1;
            for(int j=1;j<i;j++)
                if(a[i]>a[j])
                    dp[i]=max(dp[i],dp[j]+1);
        }
        int ans=-inf;
        for(int i=1;i<=n;i++)
        {
            if(dp[i]>ans)
               ans=dp[i];
        }
        return ans;
    }
    int main()
    {
        while(scanf("%d",&n)!=EOF)
        {
            for(int i=1;i<=n;i++)
                scanf("%d",&a[i]);
            int ans=DP();
            printf("%d
    ",ans);
        }
    }
    

      

  • 相关阅读:
    Windows c++面向对象与可视化编程的基础知识
    Windows c++程序的基本结构
    云计算
    分布式计算
    从贝叶斯方法谈到贝叶斯网络
    C++函数调用
    插入排序
    Http请求中请求头Content-Type讲解
    5种PHP创建数组的方式
    js数组
  • 原文地址:https://www.cnblogs.com/TAT1122/p/5869831.html
Copyright © 2011-2022 走看看