#include <iostream>
using namespace std;
int m[100][100];
int p[100];
int n;
void solve(){
cin >> n;
for(int i = 0; i < n + 1; ++i)
cin >> p[i];
for(int i = 0; i <= n; ++i)
m[i][i] = 0;
for(int r = 2; r <= n; ++r){
for(int i = 1; i <= n - r + 1; ++i){
int j = r + i - 1;
m[i][j] = m[i][i] + m[i + 1][j] + p[i - 1] * p[i] * p[j];
for(int k = i + 1; k < j; ++k){
int temp = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
if(temp < m[i][j]){
m[i][j] = temp;
}
}
}
}
cout << m[1][n];
}
int main(){
solve();
return 0;
}
时间复杂度:T(n)=O(n³)