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).
Spit Array into two such that both part form Strictly Increasing Subsequence
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).
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | saifhaider0z | 2019-06-12 21:38:55 | 30 | Tiny change: '"YES".\n\n' -> '"YES".\n\n\nBetter approach than O(2^n).' | ||
en1 | saifhaider0z | 2019-06-12 21:08:52 | 266 | Initial revision (published) |