https://www.spoj.com/problems/ONEXLIS/↵
↵
i have been trying to solve the problem for a long time...but couldnt come up with a proper approach...↵
My approach(ig wrong) : when we consider a sequence to be lis, the elements before the last element must have lds(longest strictly decreasing subsequence) > 1; however im unable to implement the idea;↵
any help would be appreciated.
↵
i have been trying to solve the problem for a long time...but couldnt come up with a proper approach...↵
My approach(ig wrong) : when we consider a sequence to be lis, the elements before the last element must have lds(longest strictly decreasing subsequence) > 1; however im unable to implement the idea;↵
any help would be appreciated.
