Pagini recente » Cod sursa (job #1307055) | Cod sursa (job #3280252) | Cod sursa (job #1637602) | Cod sursa (job #1452157) | Cod sursa (job #2431934)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("podm.in");
ofstream fout("podm.out");
long long dp[505][505];
long long v[505];
int main()
{
int j;
int n;
fin >> n;
for(int i = 0; i <= n; i++)
fin >> v[i];
for(int i = 1; i <= n - 1; i++)
dp[i][i + 1] = v[i - 1] * v[i] * v[i + 1];
for(int d = 2; d <= n; d++)
{
for(int i = 1; i <= n - d; i++)
{
j = i + d;
dp[i][j] = 1e18;
for(int k = i; k <= j; k++)
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]+v[i-1]*v[k]*v[j]);
}
}
fout << dp[1][n] <<"\n";
return 0;
}