题目来源:
http://poj.org/problem?id=1651
题目描述:
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.
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【i】【j】为从i,j取的最小价值,我们可以知道dp【i】【i】没有意义,dp【i】【i+1】=0,因为两个数就不能取了,dp【i】【i+2】=a【i】*a【i+1】*a【i+2】,所以转移方程就是dp【i】【j】=max(dp【i】【j】,dp【i】【k】+dp【k】【j】+a【i】*a【k】*a【j】);
代码对i,j有一些变化,不过意思相同。
代码:
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
const int maxn=1e5+10;
ll dp[110][110];
int arr[110],n;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&arr[i]);
//for(int i=2;i<=n-1;i++)dp[i][i]=1ll*arr[i-1]*arr[i]*arr[i+1];
for(int len=2;len<n;len++)
for(int i=2;i<=n-len+1;i++)
{
int j=len+i-1;
dp[i][j]=1e9;
for(int k=i;k<j;k++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+arr[i-1]*arr[k]*arr[j]);
}
printf("%d\n",dp[2][n]);
return 0;
}