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.
Input
The first line of the input contains the number of cards N (3 <= N <= 100). The second line contains N integers in the range from 1 to 100, separated by spaces.
Output
Output must contain a single integer - the minimal score.
Sample Input
6
10 1 50 50 20 5
Sample Output
3650
题意:不能取第一个和最后一个数,每取一个数算一下这个数乘以左右端点的值,然后把这个数删去,直到还剩两个数。
题解:区间dp,从小区间找最优,再从小区间逐步到大区间,
动态转移方程为:
dp[l][r]=min(dp[l][r],dp[l][k]+dp[k][r]+a[l]*a[k]*a[r]);
AC代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
int a[110];
int dp[110][110];
int main()
{
int n;
scanf("%d",&n);
int i,j,k;
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
int len,l,r;
//区间dp主要有三个for循环,第一层控制的是区间长度
//第二层控制的是区间端点
//第三层控制的是区间的中间点(这个中间点并不就是最中间的点),在这道题中控制的是最后一个取出来的那个数
for(len=3; len<=n; len++)
{
for(i=1; i+len-1<=n; i++)
{
l=i,r=i+len-1;
dp[l][r]=inf;
for(k=l+1; k<r; k++)
{
dp[l][r]=min(dp[l][r],dp[l][k]+dp[k][r]+a[l]*a[k]*a[r]);
}
}
}
printf("%d\n",dp[1][n]);
return 0;
}