Re: [algogeeks] [Algogeeks] Longest increasing sub sequence length in linear time

On Tue, Dec 17, 2013 at 1:30 AM, bujji jajala wrote: > Given an Array of integers (A1,A2,...,An) of length n, Find the maximum > possible length of increasing sub sequence formed from A1, A2,,An. > > > I read that it is possible to compute in linear time as mentioned in > algorithm design ma

Re: [algogeeks] coloring problem Dynamic programming

I think that can be done by having 2 different values at every position in the answer matrix. One when the previous house is of same color and one when it does not. Answer[n][k][2] will be the new dimensions. I can explain in detail if you don't get this. ☺ On Dec 15, 2013 4:43 PM, "kumar raja" w

Re: [algogeeks] [Algogeeks] Longest increasing sub sequence length in linear time

can be done with nlogn i dont think so O(n) is possible... On 17 Dec 2013 01:30, "bujji jajala" wrote: > Given an Array of integers (A1,A2,...,An) of length n, Find the maximum > possible length of increasing sub sequence formed from A1, A2,,An. > > > I read that it is possible to comput

[algogeeks] [Algogeeks] Longest increasing sub sequence length in linear time

Given an Array of integers (A1,A2,...,An) of length n, Find the maximum possible length of increasing sub sequence formed from A1, A2,,An. I read that it is possible to compute in linear time as mentioned in algorithm design manual bySkiena. -Thanks Bujji -- You received this message beca