Multiplication Puzzle
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比较简单的题。
只不过权值换了一下,合并两个区间的代价是左右两边顶点的值乘中间分割点的值。d[i][j]表示i – j-1区间的最优解。
转移方程:
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]+a[i-1]*a[k]*a[j]);
AC代码:
//#include <bits/stdc++.h>
#include <iostream>
#include <stdlib.h>
#include <cstdio>
#include <cstring>
#include <utility>
#include <string>
#define INF 0x3f3f3f
#define int long long
using namespace std;
const int mod = 1e9+7;
const int N = 1e2+10;
int a[N];
int dp[N][N];
int sum[N];
char s[N];
signed main()
{
int n;
cin>>n;
for(int i = 0; i < n ; i ++)
{
cin>>a[i];
}
for(int i = 0 ; i < n ; i ++)
{
for(int j = 0 ; j < n ; j ++)
dp[i][j] = 0;
}
for(int len = 1 ; len < n-1; len ++)
{
for(int i = 1 ; i < n-len ; i ++)
{
int j = i+len;
dp[i][j] = dp[i+1][j] + a[i-1]*a[i]*a[j];
for(int k = i ; k < j ; k ++)
{
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]+a[i-1]*a[k]*a[j]);
}
}
}
cout<<dp[1][n-1]<<endl;
}