> > > Try dynamic programming. Complexity of the algorithm would be O(n^3). >
Won't it just be O(n^2)? Suppose A is the input. Let F(i,+) denote the maximum sum you can accumulate with the sequence ending at A[i] and the last difference being positive. Define F(i,-) accordingly. Computing each F(i,+/i) takes linear time. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
