Pagini recente » Cod sursa (job #947194) | Borderou de evaluare (job #381657) | Cod sursa (job #644389) | Cod sursa (job #2874399) | Cod sursa (job #2165283)
#include <bits/stdc++.h>
#include <fstream>
///#include <climits>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long n,i,j,k,d,a[100],ma[100][100];
int main()
{
f>>n;
for(i=1;i<=n+1;i++)
f>>a[i];
for(d=1;d<=n-1;++d)
{
for(i=1;i<=n-d;++i)
{
j=i+d;
ma[i][j]=LLONG_MAX;
for(k=i;k<j;++k)
{
ma[i][j]=min(ma[i][j],ma[i][k]+ma[k+1][j]+a[i]*a[k+1]*a[j+1]);
}
}
}
g<<ma[1][n];
return 0;
}