Cod sursa(job #2348180)
Utilizator | Moanta Ionut Liviu Liviu_Ionut_Moanta | Data | 19 februarie 2019 14:40:37 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n,i,j,k,l;
int v[501],D[501][501];
int main(){
fin>>n;
for(i=1;i<=n+1;i++){
fin>>v[i];
}
for(i=1;i<=n;i++){
D[i][i+1]=0;
}
for(l=3;l<=n+1;l++){
for(i=1;l+i-1<=n+1;i++){
j=i+l-1;
D[i][j]=2000000000;
for(k=i+1;k<j;k++){
D[i][j]=min(D[i][j],D[i][k]+D[k][j]+v[k]*v[i]*v[j]);
}
}
}
fout<<D[1][n+1];
return 0;
}