• POJ2533 Longest ordered subsequence


    Longest Ordered Subsequence
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 41984   Accepted: 18481

    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
    

    Source

    Northeastern Europe 2002, Far-Eastern Subregion

    [Submit]   [Go Back]   [Status]   [Discuss]

     

     

     1 #include<cstdio>
     2 #include<iostream>
     3 using namespace std;
     4 
     5 int main()
     6 {
     7     int n, a[1100], cn = 0, Maxlenth[1100], M = 1;
     8     cin >> n;
     9     for(int i = 0; i < n; i++) {
    10         cin >> a[i];
    11         Maxlenth[i] = 1;
    12     }
    13     for(int i = n - 2; i >= 0; i--) {
    14         for(int j = i + 1; j < n; j++) {
    15             if(a[i] < a[j] && Maxlenth[i] <= Maxlenth[j]) Maxlenth[i] = 1 + Maxlenth[j];
    16             if(Maxlenth[i] > M) M = Maxlenth[i];
    17         }
    18     }
    19     cout << M << endl;
    20     return 0;
    21 }
    View Code

     

     

  • 相关阅读:
    用户场景描述
    个人工作总结(第一阶段)
    个人进度报告
    《构建之法》阅读笔记05
    《构建之法》阅读笔记04
    《构建之法》阅读笔记03
    2020寒假学习(14)
    2020寒假学习(13)
    2020寒假学习(12)
    2020寒假学习(11)
  • 原文地址:https://www.cnblogs.com/xzrmdx/p/5150546.html
Copyright © 2020-2023  润新知