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

→ Pay attention

Before contest
Educational Codeforces Round 173 (Rated for Div. 2)
19:48:52
Register now »

→ Streams

By aryanc403

Before stream 21:58:51

View all →

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	cry	169
2	maomao90	162
2	Um_nik	162
4	atcoder_official	161
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	Dominater069	154
8	awoo	154
10	luogu_official	150

View all →

→ Find user

→ Recent actions

Detailed →

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

Revision en1, by saifhaider0z, 2019-06-12 21:08:52

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".

increasing subsequence, #dp, #greedy

History

Revisions

	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)