Pagini recente » Cod sursa (job #561175) | Cod sursa (job #2719271) | Cod sursa (job #1026448) | Cod sursa (job #203385) | Cod sursa (job #1598159)
#include <fstream>
#include <climits>
#define w 501
using namespace std;
int n;int d[w];long long m[w][w];
void dinamica()
{
int i,j,k,l;
long long q;
/*for (l=1;l<=n;l++)
m[l][l]=0;*/
for (l=2;l<=n;l++)
{
//pentru fiecare secventa de lungime l
for (i=1;i<=n-l+1;i++)
{
j=i+l-1;
m[i][j]=LLONG_MAX;
//evaluam produsul A[i]*A[i+1]*...*A[j-1]*A[j]
for (k=i;k<=j-1;k++)
{
q=m[i][k]+m[k+1][j]+d[i-1]*d[k]*d[j];
//A[i]*A[i+1]*...*A[j]=(A[i]*A[i+1]*...*A[k])*(A[k]*A[k+1]*...*A[j])
if (q<m[i][j]) m[i][j]=q;
}
}
}
}
int main()
{
ifstream f("podm.in");
ofstream g("podm.out");
int i;
f>>n;
for (i=0;i<=n;i++)
f>>d[i];
dinamica();
g<<m[1][n]<<'\n';
f.close();
g.close();
return 0;
}