Pagini recente » Cod sursa (job #1118608) | Cod sursa (job #1721959) | Cod sursa (job #3146511) | Cod sursa (job #2546447) | Cod sursa (job #2163502)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int minim(int x, int y)
{
if (x<y)
return x;
return y;
}
int main()
{
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, v[510], a[510][510];
fin >> n;
for (int i=0; i<=n; i++)
fin >> v[i];
for (int i=1; i<n; i++)
a[i][i+1]=v[i-1]*v[i]*v[i+1];
for (int p=2; p<n; p++)
{
for (int i=1; i<=n-p; i++)
{
int j=i+p;
a[i][j]=INT_MAX;
for (int k=i; k<j; k++)
a[i][j]=min(a[i][j], a[i][k]+a[k+1][j]+v[i-1]*v[k]*v[j]);
}
}
fout << a[1][n];
return 0;
}