Pagini recente » Cod sursa (job #2017904) | Cod sursa (job #2684796) | Cod sursa (job #1079731) | Cod sursa (job #837200) | Cod sursa (job #2350035)
#include<fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
int v[503],D[503][503];
int main(){
fin>>n;
n++;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<n;i++)
D[i][i+1]=0;
for(int lung=2;lung<=n-1;lung++){
for(int i=1;i+lung<=n;i++){
int j=i+lung;
D[i][j]=2000000000;
for(int k=i+1;k<=j-1;k++){
D[i][j]=min(D[i][j],D[i][k]+D[k][j]+v[i]*v[k]*v[j]);
}
}
}
fout<<D[1][n];
return 0;
}