Pagini recente » Istoria paginii runda/abeqbq/clasament | Cod sursa (job #1143638) | Cod sursa (job #1011147) | Cod sursa (job #807970) | Cod sursa (job #1929904)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, d[10005], i, x, k;
unsigned long long int val;
unsigned long long int M[505][505];
int main()
{
fin>>n;
for(i=0;i<=n;++i)
fin>>d[i];
for(i=1;i<n;++i)
M[i][i+1]=d[i-1]*d[i]*d[i+1];
for(x=2;x<n;++x)
{
for(i=1;i<=n-x;++i)
{
M[i][i+x]=200000000000000000;
for(k=i;k<i+x;++k)
{
val=M[i][k]+M[k+1][i+x]+d[i-1]*d[k]*d[i+x];
M[i][i+x]=min(M[i][i+x], val);
}
}
}
fout<<M[1][n]<<'\n';
return 0;
}