Spit Array into two such that both part form Strictly Increasing Subsequence

Revision en2, by saifhaider0z, 2019-06-12 21:38:55

I wanna ask is there any why by which we can check that a given array can be split int two subsequence such that both are Strictly increasing. If not Possible Output is "NO" else "YES".

Better approach than O(2^n).

Tags increasing subsequence, #dp, #greedy

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English saifhaider0z 2019-06-12 21:38:55 30 Tiny change: '"YES".\n\n' -> '"YES".\n\n\nBetter approach than O(2^n).'
en1 English saifhaider0z 2019-06-12 21:08:52 266 Initial revision (published)