Input: a sequence <A_1, A_2, ..., A_n> of integers and an integer X.
Output: true if there is a strictly increasing subsequence of length X in sequence A, false otherwise.
Is there an O(n) algorithm for this problem ?
Is there an increasing subsequence of length X in a given sequence of length N ? can you find it in O(n)?
Input: a sequence <A_1, A_2, ..., A_n> of integers and an integer X.
Output: true if there is a strictly increasing subsequence of length X in sequence A, false otherwise.
Is there an O(n) algorithm for this problem ?