0

I am new to Dynamic Programming and was reading on the Longest Increasing Subsequence(LIS) problem.

The solution stated that the sequence need not be continuous as in the original array. Elements can be skipped in between; but I was under another impression.

Could you please help clarify this confusion.

Say for example: a = {10,22,9,33,55,66,12,90} the LIS is {10,22,33,55,66,90} => 6

However, I thought it would be {33,55,66}

Thanks

Sakshi Malhotra
  • 95
  • 11
  • The Wikipedia page for [Subsequence](https://en.wikipedia.org/wiki/Subsequence) might answer your question. Or the descriptive text on the SO `subsqeuence` tag. – Blastfurnace Sep 12 '15 at 00:30

1 Answers1

3

Subsequence doesn't need to be continous. A Subsequence is formed by deleting zero or more elements from an array. A subaaray on the other hand is always continous. Lets's take your example:

a = {10,22,9,33,55,66,12,90}

Here,{10,22,33,55,66,90} is the longest increasing subsequence and {33,55,66} is the longest increasing subarray.

So, what you are basically answering is a solution to the longest increasing subarray problem.

shivam mitra
  • 232
  • 1
  • 5
  • 12