Call a sequence X [1 .. n] of numbers accelerating if 2 ยท X [i] < X [i - 1] + X [i + 1] for all i. Describe an efficient algorithm to compute the length of the longest accelerating subsequence of an arbitrary array A of integers.
Any idea how to solve it? Regards, Kumar Raja. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
