Number Solitaire is a game played with a linear sequence of numbers. You start with no points. In each round, you remove two numbers, multiply them together, and add the product to your total. Only numbers at the two ends of the sequence (the rightmost and leftmost of the remaining numbers) are accessible; note that once you remove the first number in a round, the number next to it will be accessible and thus removable as the second number of the round. The sequence can include both positive and negative numbers, and its length is always even.
Design a dynamic programming algorithm that will compute the largest amount of points obtainable for the number sequence. The algorithm will be given the sequence length n and the sequence L =< L1,L2,··· ,Ln >.
5 freelancers are bidding on average $71 for this job
Hi! I can design the DP Algorithm for this problem. In which language do you need the solution to be. I can do it in C/C++/Java in whichever you need. Thank You!