# 【DP】poj1651 <矩阵链乘法>

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

【参考代码】

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f

int n,a[105],dp[105][105],j,k;

int main()
{
while(~scanf("%d",&n)) {
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
memset(dp,0,sizeof(dp));
for(int l=2;l<n;l++) {
for(int i=2;i<=n-l+1;i++) {
j=i+l-1;
dp[i][j]=INF;
for(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]);
}
}
printf("%d\n",dp[2][n]);
}
return 0;
}


• 本文已收录于以下专栏：

## POJ 1651 - Multiplication Puzzle(区间DP，矩阵链乘三种模版详解)

【题意】题目链接http://poj.org/problem?id=1651 给出n(<=100)个数字，每一个数字有一个权值Ai，求从中抽出除了第一个和最后一个以外的中间的数字的最小费用。抽取的顺序...

## POJ 1651 Multiplication Puzzle (区间dp 矩阵连乘)

Multiplication Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6275 Acce...

## poj2778 DNA Sequence AC自动机 dp 矩阵乘法

poj2778 DNA Sequence 题意:求仅有A G C T不含有k(k<=10)个长度为d(d<=10)串的长度为L(L<=2*10^9)的串有多少个%100000 题解: 做完感觉之...

## POJ 1651（矩阵连乘）

Multiplication Puzzle Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8753   Acce...

## POJ 1651 Multiplication Puzzle（区间DP）

http://poj.org/problem?id=1651。 头尾不动。通过从小到大枚举长度枚举区间，然后扩散到整个区间。 dp[i][j]表示从i开始到j的区间的分数最小值。 则长度显然从3...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)