Pagini recente » Cod sursa (job #534530) | Cod sursa (job #73878) | Cod sursa (job #1234748) | Cod sursa (job #374611) | Cod sursa (job #813066)
Cod sursa(job #813066)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const long long int INF=100000000000000000LL;
int d[1000], n;
long long int m[1000][1000];
void citire();
void pd();
void afisare();
int main()
{
citire();
pd();
afisare();
return 0;
}
void citire()
{
int i;
fin >> n;
for(i=0;i<=n;i++)
fin >> d[i];
}
void pd()
{
int i, j, k, x;
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(x=2;x<=n-1;x++)
{
for(i=1;i<=n-x;i++)
{
j=i+x;
m[i][j]=INF;
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]);
}
}
}
void afisare()
{
fout << m[1][n] << '\n';
}