Cod sursa(job #1334340)
| Utilizator | Data | 4 februarie 2015 11:37:01 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int n, i, j, d[503][503], k, x[503], p;
ifstream in("podm.in");
ofstream out("podm.out");
int main(){
in>>n;
for(i=1; i<=n+1; i++)
in>>x[i];
for(p=2; p<=n; p++){
for(i=1, j=i+p; j<=n+1; i++, j++){
d[i][j]=2000000000;
for(k=i+1; k<=j-1; k++)
d[i][j]=min(d[i][j], d[i][k]+x[i]*x[k]*x[j]+d[k][j]);
}
}
out<<d[1][n+1];
return 0;
}
