Pagini recente » Cod sursa (job #2828585) | Cod sursa (job #1226619) | Cod sursa (job #1733286) | Statistici Bfilmsoj (Bfilmsoj) | Cod sursa (job #2572765)
#include <bits/stdc++.h>
#define NMAX 510
#define INF 9999999999999
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int m[NMAX][NMAX];
long long int d[NMAX];
int n;
void citire();
int main()
{citire();
return 0;
}
void citire()
{int dr,i,k;
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(dr=2;dr<n;dr++)///fiecare lg posibil
for(i=1;i+dr<=n;i++)// de la i la i+dr
{
long long int minim=INF;
for(k=i;k<i+dr;k++)
minim=min(minim,m[i][k]+ m[k+1][i+dr] +d[i-1]* d[k]*d[i+dr] );
m[i][i+dr]=minim;
}
fout<<m[1][n];
}