Pagini recente » Cod sursa (job #1991026) | Cod sursa (job #3154504) | Cod sursa (job #2251218) | Cod sursa (job #651291) | Cod sursa (job #2297597)
#include <bits/stdc++.h>
#define INF 100000000000000000LL
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n,i,j,k,w,d[10001],p[10001][10001];
int main()
{
fin>>n;
for(i=0;i<=n;++i)
fin>>d[i];
/*for(i=1;i<=n;++i)
m[i][i]=0;
for(i=1;i<=n-1;++i)
m[i][i + 1] = d[i - 1] * d[i] * d[i + 1];
for(w=2;w<=n-1;++w)
for(i=1;i<=n-w;++i){
int j = i + w;
m[i][j] = 100000000000000000;
for(k=i;k<=j-1;++k)
m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + d[i - 1] * d[k] * d[j]);
}*/
for( int i=1;i<=n-1;i++ )
p[i][i+1]=d[i-1]*d[i]*d[i+1];
for( int j=2;j<=n-1;j++ )
for( int i=1;i<=n-j;i++ )
{
p[i][i+j]=INF;
for( int k=i;k<=i+j-1;k++ )
p[i][i+j]=min(p[i][i+j],p[i][k]+p[k+1][i+j]+d[i-1]*d[k]*d[i+j]);
}
fout<<p[1][n];
return 0;
}