#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1e9;
const int maxn = 1000+5;
int dp[maxn][maxn],n,p[maxn];
int solve(int i,int j){
if(dp[i][j] != INF) return dp[i][j];
if(j == i+1) return 0;
for(int k=i+1; k<j; k++){
dp[i][j] = min(dp[i][j],p[i]*p[k]*p[j] + solve(i,k) + solve(k,j));
}
return dp[i][j];
}
int main(){
cin >> n;
for(int i=0; i<n; i++)
cin >> p[i];
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
dp[i][j] = INF;
cout << solve(0,n-1) << endl;
}
dp最优矩阵相乘poj1651
最新推荐文章于 2019-08-03 12:58:58 发布