POJ 1651 Multiplication Puzzle

Multiplication Puzzle

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3513		Accepted: 2064

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

Source

Northeastern Europe 2001, Far-Eastern Subregion

题目大意：给你n个有序数  从中拿出n-2个数i  使其i*(i-1)*i+1之和最小

题目分析：有看网上的dp 矩阵连乘什么的  没看懂   遂记忆化dfs水之 把数列分成小块dfs出大块儿

代码如下：

#include <iostream> using namespace std; int a[110],mi[110][110]; int dfs(int l,int r){ if(r-l<2)return 0; int Min=10000001; for(int i=l+1;i<r;i++){ if(mi[l][i]==-1)mi[l][i]=dfs(l,i); if(mi[i][r]==-1)mi[i][r]=dfs(i,r); if(Min>mi[l][i]+mi[i][r]+a[l]*a[i]*a[r]) Min=mi[l][i]+mi[i][r]+a[l]*a[i]*a[r]; } return Min; } int main() { int n,i; cin>>n; memset(mi,-1,sizeof(mi)); for(i=1;i<=n;i++) cin>>a[i]; cout<<dfs(1,n)<<endl; return 0; }