@Saurabh Paliwal : yes
On 10/24/13, Saurabh Paliwal wrote:
> Do you mean
> *of all the increasing subsequences of length k in this array, find the one
> with maximum sum ?*
>
>
>
> On Wed, Oct 23, 2013 at 10:52 PM, atul anand
> wrote:
>
>> Given an array with N elements and integer K . Find sum o
Do you mean
*of all the increasing subsequences of length k in this array, find the one
with maximum sum ?*
On Wed, Oct 23, 2013 at 10:52 PM, atul anand wrote:
> Given an array with N elements and integer K . Find sum of longest
> increasing sub-sequence of length K elements such that sub-sequ
Given an array with N elements and integer K . Find sum of longest
increasing sub-sequence of length K elements such that sub-sequence found
is maximum among all K max su-sequence.
Eg arr[]={5,2,1,10,9,30,8,55}
K = 3
output : 10,30,55sum = 10+30+55 = 95
if K=4
output : 5,10,30,55 sum = 5+
