Pagini recente » Cod sursa (job #2068739) | Cod sursa (job #3157800) | Cod sursa (job #2068718) | Atasamentele paginii Markon | Cod sursa (job #3313936)
#include <fstream>
#define int long long
using namespace std;
int v[505], dp[505][505];
signed main()
{
ifstream cin("podm.in");
ofstream cout("podm.out");
int n;
cin >> n;
for(int i = 1; i <= n+1; i++){
cin >> v[i];
}
for(int i = 1; i <= n; i++){
dp[i][i + 1] = v[i] * v[i + 1] * v[i + 2];
}
for(int i = 3; i <= n; i++){
int l = 1, c = i, mn;
while(c <= n){
mn = v[l] * v[l + 1] * v[c + 1] + dp[l + 1][c];
for(int k = l + 1; k < c; k++){
mn = min(mn, v[l] * v[k + 1] * v[c + 1] + dp[l][k] + dp[k + 1][c]);
}
dp[l][c] = mn;
l++;
c++;
}
}
cout << dp[1][n];
return 0;
}