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 wrote:
> Hi
> Can any1 suggest a algo for heaviest increasing subsequence of a given
> array?
>
banned,
trying to cheat, aye ?
no more replies on this topic, until Wednesday
On Sun, Jan 8, 2012 at 10:16 AM, kumar rajat 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)
>
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
