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,55 sum = 10+30+55 = 95
if K=4
output : 5,10,30,55 sum = 5+10+30+55 =100
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
