Pagini recente » Cod sursa (job #189536) | Cod sursa (job #1596748) | Cod sursa (job #2615385) | Cod sursa (job #647717) | Cod sursa (job #2114939)
#include<fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long n, a[505] d[505][505];
int main()
{
f>>n;
for(int i=1;i<=n+1;i++)
f>>a[i];
/*for(int i=1;i<=n;i++)
d[i][i+1]=0;*/
for(int l=3;l<=n+1;l++)
for(int i=1;i+l-1<=n+1;i++)
{
int j=i+l-1;
d[i][j]=2000000000;
for(int k=i+1;k<j;k++)
d[i][j]=min(d[i][j], d[i][k]+d[k][j]+a[i]*a[k]*a[j]);
}
g<<d[1][n+1];
return 0;
}