Description
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
10*1*50 + 50*20*5 + 10*50*5 = 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
1*50*20 + 1*20*5 + 10*1*5 = 1000+100+50 = 1150.
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
If he would take the cards in the opposite order, i.e. 50, then 20, then 1, the score would be
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
(st,ed)中间一定有一个k,是最后拿走的,所以同理(st,k)(k,ed),区间内是同样的道理,所以递归,记忆化,当然也可以递推
#include<cstdio>
#include<cstring>
#include<algorithm>
typedef long long ll;
using namespace std;
const int INF=0x3f3f3f3f;
const int maxn=110;
int dp[maxn][maxn];
int val[maxn];
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&val[i]);
memset(dp,0,sizeof(dp));
for(int l=3;l<=n;l++){
for(int i=0;i<n-l+1;i++){
int j=i+l-1;
dp[i][j]=INF;
for(int k=i+1;k<j;k++){//中间先取哪一个
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+val[i]*val[j]*val[k]);
}
// printf("i:%d j:%d %d\n",i,j,dp[i][j]);
}
}
printf("%d\n",dp[0][n-1]);
return 0;
}
#include<cstdio>
#include<cstring>
#include<algorithm>
typedef long long ll;
using namespace std;
const int INF=0x3f3f3f3f;
const int maxn=110;
int dp[maxn][maxn];
int val[maxn];
int solve(int st,int ed){//最终肯定会留下一个,枚举最后留下的是那个k ,记忆化
if(dp[st][ed]!=INF) return dp[st][ed];
if(ed==st+1) return dp[st][ed]=0;
for(int k=st+1;k<ed;k++){
dp[st][ed]=min(dp[st][ed],solve(st,k)+solve(k,ed)+val[st]*val[k]*val[ed]);
}
return dp[st][ed];
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&val[i]);
memset(dp,INF,sizeof(dp));
printf("%d\n",solve(0,n-1));
return 0;
}