the simplest solution for longest increasing continuous array length is O(n) and the simplest solution for longest increasing continuous subsequence length is O(n^2).
a solution for spiral is http://www.ideone.com/ygjsq -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
