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,
();
}
}
return 0;
}
On Tue, Dec 27, 2011 at 10:33 AM, kumar rajat
thebossku...@gmail.comwrote:
*I am not able to follow..
On Tue, Dec 27, 2011 at 11:47 PM, kumar rajat thebossku...@gmail.com
wrote:
@Lucifier:
Thanks a lot..
But,I am able to follow the code that u posted
Hi
I have jus started to learn DP and I have coded the standard
algorithms(LCS,etc).
I have been trying these problems in SPOJ:
http://www.spoj.pl/problems/NOVICE63/
http://www.spoj.pl/problems/NY10E/
I understand these may be solved elegantly using DP,but I dont get to
code the same.
Can any1
0. stop here.
You can go for this by starting from 2 till no. is less than given N
On Tue, Dec 27, 2011 at 7:28 PM, kumar rajat thebossku...@gmail.com wrote:
Hi
I have jus started to learn DP and I have coded the standard
algorithms(LCS,etc).
I have been trying these problems
*I am not able to follow..
On Tue, Dec 27, 2011 at 11:47 PM, kumar rajat thebossku...@gmail.com wrote:
@Lucifier:
Thanks a lot..
But,I am able to follow the code that u posted for Non-Decreasing Digits.
Can u jus explain ur algo instead of givin the code directly?
Thanks once again.
On Tue
