Pagini recente » Cod sursa (job #1214074) | Cod sursa (job #2404994) | Cod sursa (job #3176709) | Cod sursa (job #2929516) | Cod sursa (job #2884267)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int NMAX = 505;
int m[NMAX];
long long dp[NMAX][NMAX];
int main()
{
int n;
fin>>n;
n++;
for(int i = 1;i <= n;i++)
fin>>m[i];
for(int len = 1;len < n - 1;len++)
{
for(int i = 1;i <= n - len;i++)
{
int j = i + len;
int minn = INT_MAX;
for(int k = i;j < j;k++)
{
minn = min(minn,dp[i][k - 1] + dp[k + 1][j] + 1LL * dim[i - 1] * dim[j] * dim[k]);
}
dp[i][j] = minn;
}
}
fout<<dp[1][n - 1];
return 0;
}