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).
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
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) |
Name |
---|