Keep 2D arrray. For each segment (i, j) calculate min and max value for the subexpression. To do this, iterate k over (i, j), check operation at k-th position and choose the best one.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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?hl=en.
