Pagini recente » Cod sursa (job #2850927) | Cod sursa (job #1414726) | Cod sursa (job #2884646) | Cod sursa (job #3124018) | Cod sursa (job #2847150)
#include<bits/stdc++.h>
using namespace std;
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll
ifstream fin("podm.in"); ofstream fout("podm.out");
#define cin fin
#define cout fout
int n, d[505];
int dp[505][505];
int32_t main(){
INIT
cin>>n;
for(int i=1; i<=n+1; i++){
cin>>d[i];
}
for(int sz=1; sz<=n; sz++){
for(int i=1; i<=(n-sz+1); i++){
for(int j=i; j<(i+sz-1); j++){
if(dp[i][i+sz-1]==0){
dp[i][i+sz-1]=dp[i][j]+dp[j+1][i+sz-1]+d[i]*d[j+1]*d[ i+sz ];
}
else{
dp[i][i+sz-1]=min( dp[i][i+sz-1], dp[i][j]+dp[j+1][i+sz-1]+d[i]*d[j+1]*d[ i+sz ] );
}
}
}
}
/*
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
cout<<dp[i][j]<<" ";
}
cout<<"\n";
}
*/
cout<<dp[1][n];
return 0;
}