Yes. My solution isn't right. It's not a matroid, so greedy doesn't
work. You need a dynamic program.
On Aug 28, 5:41 am, gaurav singhal <singhal08gau...@gmail.com> wrote:
> @ Gene :
>
> Output for
>
> int a[] = { 14, 15, 16, 13, 11, 18 };
>
> is coming out to be 14
>
> whereas minimum cost will be : 8
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
