POJ 1651（矩阵连乘）

Multiplication Puzzle

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8753		Accepted: 5478

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

分析：

设计算A[i:j]，1≤i≤j≤n，所需要的最少数乘次数m[i,j]，则原问题的最优值为m[1,n]。

当i=j时，A[i:j]=Ai，因此，m[i][i]=0，i=1,2,…,n
当i<j时，若A[i:j]的最优次序在Ak和Ak+1之间断开，i<=k<j,则：m[i][j]=m[i][k]+m[k+1][j]+pi-1pkpj。由于在计算是并不知道断开点k的位置，所以k还未定。不过k的位置只有j-i个可能。因此，k是这j-i个位置使计算量达到最小的那个位置。

      综上，有递推关系如下：

          

代码：

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long int ll;

const int maxn = 105;
int N;
int  a[maxn];
ll ans[maxn][maxn];

int main(){
	
	scanf("%d",&N);
	for(int i=0; i<N; i++)
		scanf("%d",a+i);
	for(int step=2; step<N; step++){
		for(int i=1; i<=N-step; i++){
			int j = i+step-1;
			ans[i][j] = ans[i][i] + ans[i+1][j] + a[i-1]*a[i]*a[j];
			for(int k=i+1; k<j; k++){
				ans[i][j] = min(ans[i][j],ans[i][k]+ans[k+1][j]+a[i-1]*a[k]*a[j]);
			}
		}
	}
	printf("%I64d\n",ans[1][N-1]);
	return 0;
}