Pagini recente » Cod sursa (job #564469) | Cod sursa (job #210353) | Cod sursa (job #1531739) | Cod sursa (job #2106708) | Cod sursa (job #2565466)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long n,v[510],d[510][510],i,j,k,l;
int main(){
fin>>n;
for(i=1;i<=n+1;i++){
fin>>v[i];
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
d[i][j]=1000000000;
d[i][i]=0;
}
for(l=2;l<=n;l++){
for(i=1;i+l-1<=n;i++){
for(j=i;j<min(i+l-1,n);j++)
d[i][i+l-1]=min(d[i][i+l-1],d[i][j]+d[j+1][i+l-1]+v[i]*v[j+1]*v[i+l]);
}
}
fout<<d[1][n];
return 0;
}