Pagini recente » Cod sursa (job #2056192) | Cod sursa (job #3179976) | Cod sursa (job #96769) | Cod sursa (job #3227400) | Cod sursa (job #1878351)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n,d[505],dp[505][505];
void read()
{
fin>>n;
for(int i=0;i<=n;i++)
fin>>d[i];
}
void rezolv()
{
int mnm,j;
for(int i=1;i<n;i++)
dp[i][i+1]=d[i-1]*d[i]*d[i+1];
for(int l=2;l<=n;l++)
for(int i=1;i<=n-l+1;i++)
{
j=i+l-1;
mnm=1000000000;
for(int k=i;k<j;k++)
mnm=min(mnm,dp[i][k]+dp[k+1][j]+d[i-1]*d[k]*d[j]);
dp[i][j]=mnm;
}
}
void afisare()
{
fout<<dp[1][n];
}
int main()
{
read();
rezolv();
afisare();
return 0;
}