Pagini recente » Cod sursa (job #2110555) | Cod sursa (job #2106956) | Cod sursa (job #3193792) | Cod sursa (job #13444) | Cod sursa (job #1874628)
#include <fstream>
using namespace std;
ifstream fi("podm.in");
ofstream fo("podm.out");
#define maxn 10505
int d[maxn],m[maxn][maxn];
int n,i,j,k,w;
int main()
{
fi>>n;
for(i=0;i<=n;i++) fi>>d[i];
for(i=1;i<n;i++)
m[i][i+1]=d[i-1]*d[i]*d[i+1];
for(j=2;j<n;j++)
for(i=1;i<=n-j;i++){
w=i+j;
m[i][w]=10000000;
for(k=i;k<w;k++)
m[i][w]=min(m[i][w],(m[i][k]+m[k+1][w]+d[i-1]*d[k]*d[w]));
}
fo<<m[1][n];
return 0;
}