Cod sursa(job #2549619)
| Utilizator | Data | 17 februarie 2020 20:52:47 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, i, j, k, l;
long long v[510], d[510][510];
int main(){
fin>>n;
n++;
for(i=1; i<=n; i++){
fin>>v[i];
}
for(l=3; l<=n; l++){
for(i=1; i+l-1<=n; i++){
j=i+l-1;
d[i][j]=1000000000;
for(k=i+1; k<j; k++){
d[i][j]=min(d[i][j], d[i][k]+d[k][j]+v[i]*v[k]*v[j]);
}
}
}
fout<<d[1][n];
}
