was wondering how to do the same problem in O(nlogn)
-- Vinod
On Wed, Dec 2, 2009 at 11:48 AM, ranjmis ranj...@gmail.com wrote:
Vinod. Can you please mention steps for the O(n^2) solution that you
have thought of.
On Dec 2, 9:50 am, Vinoth Kumar vinoth.ratna.ku...@gmail.com wrote:
No need
Given an array A which holds a permutation of 1,2,...,n. A sub-block A
[i..j] of an array A
is called a valid block if all the numbers appearing in A[i..j] are
consecutive numbers (may not be in order.
Given an array A= [ 7 3 4 1 2 6 5 8]
the valid blocks are [3 4], [1,2], [6,5], [3 4 1 2], [3 4
would miss [3 4 2]
On Dec 1, 10:10 am, sharad kumar aryansmit3...@gmail.com wrote:
find out the subseq which are consecttive
concatenate them at each level to get the entire set.
On Tue, Dec 1, 2009 at 12:03 PM, Vinoth Kumar
vinoth.ratna.ku...@gmail.comwrote:
Given an array A which
