isnt it is similar to finding longest subsequence , here deciding factor is the weight of the subsequence , so W(old) < W(new) ..update new sequence found.
On Sun, Jan 8, 2012 at 10:16 AM, kumar rajat <[email protected]> wrote: > Hi > Can any1 suggest a algo for heaviest increasing subsequence of a given > array? > (HIS is the LIS when weights are included for each element in the > array) > > Thanks in advance > > -- > 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. > > -- 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.
