Q- There are n consecutive shops. two mafias plan to rob the shops. Each shop has cash in their locker. there is one restriction that they cannot rob any consecutive shop. write a program that will maximize their profit. cash in the shops were given in x[i] i=1...
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
