Pagini recente » Cod sursa (job #1508987) | Cod sursa (job #2261422) | Cod sursa (job #2699980) | Cod sursa (job #23407) | Cod sursa (job #3125407)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 500;
int n,v[NMAX],dp[NMAX][NMAX];
ifstream fin("podm.in");
ofstream fout("podm.out");
int main()
{
fin >> n;
n++;
for(int i = 1; i <= n; i++){
fin >> v[i];
dp[i][i+1] = 0;
}
for(int l = 3; l <= n; l++){
for(int i = 1; i <= n-l+1; i++){
int j = i+l-1;
dp[i][j] = INT_MAX;
for(int k = i+1; k < j; k++){
dp[i][j] = min(dp[i][j], dp[i][k]+dp[k][j]+v[i]*v[k]*v[j]);
}
}
}
fout << dp[1][n];
return 0;
}