Pagini recente » Cod sursa (job #489941) | Cod sursa (job #2413569) | Cod sursa (job #2304680) | Cod sursa (job #1972555) | Cod sursa (job #1032879)
#include <iostream>
#include<fstream>
using namespace std;
long long d[505];
int n;
long long c[505][505];
void Citire()
{
ifstream fin("podm.in");
fin>>n;
for(int i=0;i<=n;i++)
fin>>d[i];
fin.close();
}
void Rezolvare()
{
for(int i=1;i<n;i++)
c[i][i+1]=d[i-1]*d[i]*d[i+1];
long long x ,minim=100000000000000LL;
int j;
for(int pas=2;pas<=n;pas++)
{
for(int i=1;i<=n-pas+1;i++)
{
j=i+pas-1;
minim=100000000000000LL;
for(int k=i;k<j;k++)
{
x=c[i][k]+c[k+1][j]+d[i-1]*d[k]*d[j];
if(x<minim) minim=x;
}
c[i][j]=minim;
}
}
ofstream fout("podm.out");
fout<<c[1][n]<<"\n";
fout.close();
}
int main()
{
Citire();
Rezolvare();
return 0;
}