Pagini recente » Cod sursa (job #1281724) | Cod sursa (job #2155709) | Cod sursa (job #1999562) | Cod sursa (job #631674) | Cod sursa (job #2162790)
#include <iostream>
#include <fstream>
using namespace std;
int minim(int x, int y)
{
if (x==0)
return y;
if (y==0)
return x;
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<=p; i++)
{
int j=i+p;
a[i][j]=min(a[i][j-1]+v[i-1]*v[j]*v[j-1], a[i+1][j]+v[i-1]*v[i]*v[j]);
}
}
fout << a[1][n];
return 0;
}