Pagini recente » Cod sursa (job #1198700) | Cod sursa (job #338186) | Cod sursa (job #1425176) | Cod sursa (job #3277243) | Cod sursa (job #2374382)
#include<fstream>
using namespace std;
ifstream f ("podm.in");
ofstream g ("podm.out");
long long d[1010][1010],a[1010];
int n;
int main()
{
f>>n;
for(int i=0;i<=n;++i){
f>>a[i];
}
for(int k=2;k<=n;++k){
for(int i=1;i<=n-k+1;++i){
int j=i+k-1;
d[i][j]=99999999999999999;
for(int l=i;l<=j;++l){
d[i][j]=min(d[i][j],d[i][l]+d[l+1][j]+a[i-1]*a[j]*a[l]);
}
}
}
g<<d[1][n];
}