Coders Packet

Longest strictly increasing Subsequence of an array using C++

By Shaik Jafar

  • lon_inc_seq.cpp
  • This project gives the longest possible strictly increasing subsequence of an array which is input by the user using C++ programming language.

    In this project, the user is asked to give the size of the array followed by the elements of the array.

    This outputs the Longest strictly-increasing subsequence in the array using C++ programming language.

    Note: A subsequence of an array is obtained by removing some elements(possibly zero) from an array.

     

    Constraints

    1 <= size of array <= 10^7

    -10^7 <= element of array <= 10^7

     

    Sample input:

    Enter the size of the array 8

    Enter the elements of the array 5 1 2 3 6 8 7 4

    Sample output:

    The Longest strictly-increasing subsequence is : 1 2 3 6 8

    Explanation:

    In the given array,one of the subsequences with longest possible length is 1 2 3 6 8.

    Download Complete Code

    Comments

    Comments for the packet "Longest strictly increasing Subsequence of an array using C++";
    No comments yet