Pagini recente » Cod sursa (job #57425) | Cod sursa (job #2400783) | Cod sursa (job #1836992) | Cod sursa (job #1673928) | Cod sursa (job #613381)
Cod sursa(job #613381)
#include <cstdio>
#include <algorithm>
#define Lmax 505
#define INF 500000000000000005LL
using namespace std;
FILE *fin=freopen("podm.in","r",stdin);
FILE *fout=freopen("podm.out","w",stdout);
long long m[Lmax][Lmax],d[Lmax];
int n;
void read()
{
scanf("%d",&n);
for(int i=0;i<=n;++i)
scanf("%d",&d[i]);
}
void solve()
{
for(int i=1;i<n;++i)
m[i][i+1]=d[i]*d[i+1]*d[i-1];
for(int k=2;k<=n-1;++k)
for(int i=1;i<=n-k;++i)
{
int j=i+k;
m[i][j]=INF;
for(int l=i;l<j;l++)
m[i][j]=min(m[i][j],m[i][l]+m[l+1][i]+d[i-1]*d[l]*d[j]);
}
}
void print()
{
printf("%d\n",m[1][n]);
}
int main()
{
read();
solve();
print();
return 0;
}