题解POJ - 1651 Multiplication Puzzle (区间DP)

题目传送门

The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the product of the number on the card taken and the numbers on the cards on the left and on the right of it. It is not allowed to take out the first and the last card in the row. After the final move, only two cards are left in the row.

The goal is to take cards in such order as to minimize the total number of scored points.

For example, if cards in the row contain numbers 10 1 50 20 5, player might take a card with 1, then 20 and 50, scoring
10150 + 50205 + 10505 = 500+5000+2500 = 8000

If he would take the cards in the opposite order, i.e. 50, then 20, then 1, the score would be
15020 + 1205 + 1015 = 1000+100+50 = 1150.

题意：
一个数组(1-n)，首尾不能动外，每次从中间取出一个数，得到其价值，得出当只剩下最后两个数时，最小价值。每个数的价值=当前相邻位置和自己三个数的乘积。

题解：区间DP

/**
区间DP
子问题边界：区间长度小于2
dp[左边界i][右边界j] [i, j)
dp[i][j] = min(dp[i][j], dp[i][k] + a[i-1]*a[i]*a[j] + dp[k+1][j])
*/
#include<iostream>
#include<cstdio>
#include